./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.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_codestructure_normal_file-58.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 96b38d981ab2c29d6aa004a84880ce68546a2e4edd87db11e524adc2046dd497
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 18:52:14,750 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 18:52:14,803 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-03 18:52:14,809 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 18:52:14,810 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 18:52:14,835 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 18:52:14,835 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 18:52:14,836 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 18:52:14,836 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 18:52:14,836 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 18:52:14,836 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 18:52:14,836 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 18:52:14,837 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 18:52:14,837 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 18:52:14,837 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 18:52:14,837 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 18:52:14,838 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 18:52:14,838 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 18:52:14,838 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-03 18:52:14,838 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 18:52:14,838 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 18:52:14,838 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 18:52:14,838 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 18:52:14,838 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 18:52:14,839 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 18:52:14,839 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 18:52:14,839 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 18:52:14,839 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 18:52:14,839 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 18:52:14,839 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 18:52:14,839 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 18:52:14,839 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 18:52:14,839 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 18:52:14,839 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 18:52:14,839 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 18:52:14,840 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 18:52:14,840 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 18:52:14,840 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-03 18:52:14,840 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-03 18:52:14,840 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 18:52:14,840 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 18:52:14,840 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 18:52:14,840 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 18:52:14,840 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 -> 96b38d981ab2c29d6aa004a84880ce68546a2e4edd87db11e524adc2046dd497
[2025-03-03 18:52:15,043 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 18:52:15,049 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 18:52:15,051 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 18:52:15,052 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 18:52:15,052 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 18:52:15,053 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.i
[2025-03-03 18:52:16,144 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ea2aff0/c19a8b5b68654ee9b4a51933b420b191/FLAGf355184cf
[2025-03-03 18:52:16,435 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 18:52:16,435 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.i
[2025-03-03 18:52:16,449 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ea2aff0/c19a8b5b68654ee9b4a51933b420b191/FLAGf355184cf
[2025-03-03 18:52:16,720 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ea2aff0/c19a8b5b68654ee9b4a51933b420b191
[2025-03-03 18:52:16,722 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 18:52:16,723 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 18:52:16,723 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 18:52:16,724 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 18:52:16,726 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 18:52:16,727 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:52:16" (1/1) ...
[2025-03-03 18:52:16,727 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c80abce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:16, skipping insertion in model container
[2025-03-03 18:52:16,727 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:52:16" (1/1) ...
[2025-03-03 18:52:16,738 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 18:52:16,831 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_codestructure_normal_file-58.i[913,926]
[2025-03-03 18:52:16,887 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 18:52:16,900 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 18:52:16,908 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_codestructure_normal_file-58.i[913,926]
[2025-03-03 18:52:16,935 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 18:52:16,949 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 18:52:16,949 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:16 WrapperNode
[2025-03-03 18:52:16,949 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 18:52:16,950 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 18:52:16,951 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 18:52:16,951 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 18:52:16,954 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:16" (1/1) ...
[2025-03-03 18:52:16,961 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:16" (1/1) ...
[2025-03-03 18:52:16,986 INFO  L138                Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151
[2025-03-03 18:52:16,986 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 18:52:16,987 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 18:52:16,987 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 18:52:16,987 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 18:52:16,992 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:16" (1/1) ...
[2025-03-03 18:52:16,992 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:16" (1/1) ...
[2025-03-03 18:52:16,995 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:16" (1/1) ...
[2025-03-03 18:52:17,010 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 18:52:17,011 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:16" (1/1) ...
[2025-03-03 18:52:17,011 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:16" (1/1) ...
[2025-03-03 18:52:17,020 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:16" (1/1) ...
[2025-03-03 18:52:17,026 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:16" (1/1) ...
[2025-03-03 18:52:17,027 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:16" (1/1) ...
[2025-03-03 18:52:17,031 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:16" (1/1) ...
[2025-03-03 18:52:17,033 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 18:52:17,034 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 18:52:17,035 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 18:52:17,035 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 18:52:17,036 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:16" (1/1) ...
[2025-03-03 18:52:17,039 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 18:52:17,047 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:52:17,058 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 18:52:17,061 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 18:52:17,078 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 18:52:17,078 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-03 18:52:17,079 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-03 18:52:17,079 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-03 18:52:17,079 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 18:52:17,079 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 18:52:17,130 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 18:52:17,132 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 18:52:17,408 INFO  L?                        ?]: Removed 8 outVars from TransFormulas that were not future-live.
[2025-03-03 18:52:17,409 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 18:52:17,417 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 18:52:17,418 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 18:52:17,419 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:52:17 BoogieIcfgContainer
[2025-03-03 18:52:17,419 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 18:52:17,421 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 18:52:17,422 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 18:52:17,424 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 18:52:17,424 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:52:16" (1/3) ...
[2025-03-03 18:52:17,425 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a4b72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:52:17, skipping insertion in model container
[2025-03-03 18:52:17,426 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:16" (2/3) ...
[2025-03-03 18:52:17,426 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a4b72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:52:17, skipping insertion in model container
[2025-03-03 18:52:17,426 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:52:17" (3/3) ...
[2025-03-03 18:52:17,427 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-58.i
[2025-03-03 18:52:17,436 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 18:52:17,439 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-58.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 18:52:17,472 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 18:52:17,480 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;@74d98c5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 18:52:17,480 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 18:52:17,483 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-03-03 18:52:17,493 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2025-03-03 18:52:17,493 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:52:17,494 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:17,494 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:52:17,498 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:52:17,498 INFO  L85        PathProgramCache]: Analyzing trace with hash 318885378, now seen corresponding path program 1 times
[2025-03-03 18:52:17,502 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:52:17,503 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200994144]
[2025-03-03 18:52:17,503 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:52:17,503 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:52:17,563 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes.
[2025-03-03 18:52:17,576 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements.
[2025-03-03 18:52:17,577 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:52:17,578 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:52:17,702 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked.
[2025-03-03 18:52:17,703 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:52:17,703 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200994144]
[2025-03-03 18:52:17,703 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200994144] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:52:17,704 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390047967]
[2025-03-03 18:52:17,704 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:52:17,704 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:52:17,704 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:52:17,706 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 18:52:17,708 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 18:52:17,760 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes.
[2025-03-03 18:52:17,815 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements.
[2025-03-03 18:52:17,816 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:52:17,816 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:52:17,818 INFO  L256         TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-03 18:52:17,826 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:52:17,865 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked.
[2025-03-03 18:52:17,865 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 18:52:17,865 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [390047967] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:52:17,865 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-03 18:52:17,866 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-03 18:52:17,868 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122580654]
[2025-03-03 18:52:17,869 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:52:17,873 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 18:52:17,873 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:52:17,884 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 18:52:17,884 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 18:52:17,886 INFO  L87              Difference]: Start difference. First operand  has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand  has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28)
[2025-03-03 18:52:17,902 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:52:17,902 INFO  L93              Difference]: Finished difference Result 138 states and 247 transitions.
[2025-03-03 18:52:17,903 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 18:52:17,904 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 170
[2025-03-03 18:52:17,904 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:52:17,908 INFO  L225             Difference]: With dead ends: 138
[2025-03-03 18:52:17,908 INFO  L226             Difference]: Without dead ends: 69
[2025-03-03 18:52:17,910 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 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 18:52:17,912 INFO  L435           NwaCegarLoop]: 106 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, 106 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 18:52:17,912 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 18:52:17,920 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2025-03-03 18:52:17,940 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69.
[2025-03-03 18:52:17,941 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 69 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-03-03 18:52:17,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 106 transitions.
[2025-03-03 18:52:17,946 INFO  L78                 Accepts]: Start accepts. Automaton has 69 states and 106 transitions. Word has length 170
[2025-03-03 18:52:17,946 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:52:17,946 INFO  L471      AbstractCegarLoop]: Abstraction has 69 states and 106 transitions.
[2025-03-03 18:52:17,946 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28)
[2025-03-03 18:52:17,946 INFO  L276                IsEmpty]: Start isEmpty. Operand 69 states and 106 transitions.
[2025-03-03 18:52:17,949 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2025-03-03 18:52:17,949 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:52:17,950 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:17,956 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-03 18:52:18,151 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 18:52:18,151 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:52:18,152 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:52:18,152 INFO  L85        PathProgramCache]: Analyzing trace with hash -1793299838, now seen corresponding path program 1 times
[2025-03-03 18:52:18,152 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:52:18,152 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590041126]
[2025-03-03 18:52:18,152 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:52:18,152 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:52:18,171 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes.
[2025-03-03 18:52:18,267 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements.
[2025-03-03 18:52:18,267 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:52:18,267 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:52:22,259 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-03 18:52:22,259 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:52:22,259 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590041126]
[2025-03-03 18:52:22,259 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590041126] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:52:22,259 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:52:22,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-03-03 18:52:22,260 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370970900]
[2025-03-03 18:52:22,260 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:52:22,262 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-03 18:52:22,262 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:52:22,263 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-03 18:52:22,264 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2025-03-03 18:52:22,264 INFO  L87              Difference]: Start difference. First operand 69 states and 106 transitions. Second operand  has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-03 18:52:22,852 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:52:22,852 INFO  L93              Difference]: Finished difference Result 146 states and 208 transitions.
[2025-03-03 18:52:22,852 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-03 18:52:22,853 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170
[2025-03-03 18:52:22,853 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:52:22,854 INFO  L225             Difference]: With dead ends: 146
[2025-03-03 18:52:22,854 INFO  L226             Difference]: Without dead ends: 144
[2025-03-03 18:52:22,855 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156
[2025-03-03 18:52:22,855 INFO  L435           NwaCegarLoop]: 119 mSDtfsCounter, 180 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 18:52:22,855 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 571 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 18:52:22,856 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 144 states.
[2025-03-03 18:52:22,867 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 92.
[2025-03-03 18:52:22,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 55 states have internal predecessors, (69), 35 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35)
[2025-03-03 18:52:22,869 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 139 transitions.
[2025-03-03 18:52:22,870 INFO  L78                 Accepts]: Start accepts. Automaton has 92 states and 139 transitions. Word has length 170
[2025-03-03 18:52:22,871 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:52:22,872 INFO  L471      AbstractCegarLoop]: Abstraction has 92 states and 139 transitions.
[2025-03-03 18:52:22,872 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-03 18:52:22,872 INFO  L276                IsEmpty]: Start isEmpty. Operand 92 states and 139 transitions.
[2025-03-03 18:52:22,875 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2025-03-03 18:52:22,875 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:52:22,875 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:22,875 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-03 18:52:22,875 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:52:22,876 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:52:22,876 INFO  L85        PathProgramCache]: Analyzing trace with hash -1764670687, now seen corresponding path program 1 times
[2025-03-03 18:52:22,876 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:52:22,876 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118044270]
[2025-03-03 18:52:22,876 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:52:22,877 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:52:22,888 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes.
[2025-03-03 18:52:22,916 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements.
[2025-03-03 18:52:22,916 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:52:22,916 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:52:26,615 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-03 18:52:26,616 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:52:26,616 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118044270]
[2025-03-03 18:52:26,616 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118044270] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:52:26,616 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:52:26,616 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-03-03 18:52:26,616 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426790444]
[2025-03-03 18:52:26,616 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:52:26,616 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-03 18:52:26,616 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:52:26,618 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-03 18:52:26,618 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110
[2025-03-03 18:52:26,618 INFO  L87              Difference]: Start difference. First operand 92 states and 139 transitions. Second operand  has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-03 18:52:27,559 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:52:27,559 INFO  L93              Difference]: Finished difference Result 152 states and 213 transitions.
[2025-03-03 18:52:27,560 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-03 18:52:27,560 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170
[2025-03-03 18:52:27,562 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:52:27,564 INFO  L225             Difference]: With dead ends: 152
[2025-03-03 18:52:27,565 INFO  L226             Difference]: Without dead ends: 150
[2025-03-03 18:52:27,565 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342
[2025-03-03 18:52:27,567 INFO  L435           NwaCegarLoop]: 110 mSDtfsCounter, 175 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-03 18:52:27,568 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 578 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-03 18:52:27,568 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2025-03-03 18:52:27,583 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 81.
[2025-03-03 18:52:27,585 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 81 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-03-03 18:52:27,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 121 transitions.
[2025-03-03 18:52:27,589 INFO  L78                 Accepts]: Start accepts. Automaton has 81 states and 121 transitions. Word has length 170
[2025-03-03 18:52:27,589 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:52:27,589 INFO  L471      AbstractCegarLoop]: Abstraction has 81 states and 121 transitions.
[2025-03-03 18:52:27,589 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-03 18:52:27,589 INFO  L276                IsEmpty]: Start isEmpty. Operand 81 states and 121 transitions.
[2025-03-03 18:52:27,591 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2025-03-03 18:52:27,592 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:52:27,593 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:27,593 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-03 18:52:27,593 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:52:27,593 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:52:27,593 INFO  L85        PathProgramCache]: Analyzing trace with hash -905796157, now seen corresponding path program 1 times
[2025-03-03 18:52:27,593 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:52:27,593 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072424419]
[2025-03-03 18:52:27,594 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:52:27,594 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:52:27,601 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes.
[2025-03-03 18:52:27,636 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements.
[2025-03-03 18:52:27,636 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:52:27,636 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:52:29,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-03 18:52:29,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:52:29,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072424419]
[2025-03-03 18:52:29,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072424419] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:52:29,331 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:52:29,332 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-03-03 18:52:29,332 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208326071]
[2025-03-03 18:52:29,332 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:52:29,332 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-03 18:52:29,332 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:52:29,333 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-03 18:52:29,333 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2025-03-03 18:52:29,333 INFO  L87              Difference]: Start difference. First operand 81 states and 121 transitions. Second operand  has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-03 18:52:29,692 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:52:29,693 INFO  L93              Difference]: Finished difference Result 153 states and 214 transitions.
[2025-03-03 18:52:29,693 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-03 18:52:29,693 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170
[2025-03-03 18:52:29,694 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:52:29,694 INFO  L225             Difference]: With dead ends: 153
[2025-03-03 18:52:29,694 INFO  L226             Difference]: Without dead ends: 151
[2025-03-03 18:52:29,695 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156
[2025-03-03 18:52:29,695 INFO  L435           NwaCegarLoop]: 128 mSDtfsCounter, 160 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:52:29,696 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 593 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:52:29,696 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 151 states.
[2025-03-03 18:52:29,708 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 82.
[2025-03-03 18:52:29,709 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 82 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-03-03 18:52:29,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 123 transitions.
[2025-03-03 18:52:29,710 INFO  L78                 Accepts]: Start accepts. Automaton has 82 states and 123 transitions. Word has length 170
[2025-03-03 18:52:29,711 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:52:29,711 INFO  L471      AbstractCegarLoop]: Abstraction has 82 states and 123 transitions.
[2025-03-03 18:52:29,711 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-03 18:52:29,711 INFO  L276                IsEmpty]: Start isEmpty. Operand 82 states and 123 transitions.
[2025-03-03 18:52:29,712 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2025-03-03 18:52:29,712 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:52:29,713 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:29,713 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-03 18:52:29,713 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:52:29,713 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:52:29,713 INFO  L85        PathProgramCache]: Analyzing trace with hash -877167006, now seen corresponding path program 1 times
[2025-03-03 18:52:29,713 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:52:29,713 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214408710]
[2025-03-03 18:52:29,713 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:52:29,713 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:52:29,722 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes.
[2025-03-03 18:52:29,743 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements.
[2025-03-03 18:52:29,743 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:52:29,743 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:52:33,701 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-03 18:52:33,701 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:52:33,701 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214408710]
[2025-03-03 18:52:33,701 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214408710] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:52:33,701 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:52:33,701 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-03-03 18:52:33,701 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021322404]
[2025-03-03 18:52:33,701 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:52:33,702 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-03 18:52:33,702 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:52:33,702 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-03 18:52:33,702 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2025-03-03 18:52:33,703 INFO  L87              Difference]: Start difference. First operand 82 states and 123 transitions. Second operand  has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-03 18:52:34,042 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:52:34,042 INFO  L93              Difference]: Finished difference Result 140 states and 195 transitions.
[2025-03-03 18:52:34,043 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-03-03 18:52:34,043 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170
[2025-03-03 18:52:34,043 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:52:34,044 INFO  L225             Difference]: With dead ends: 140
[2025-03-03 18:52:34,044 INFO  L226             Difference]: Without dead ends: 138
[2025-03-03 18:52:34,044 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156
[2025-03-03 18:52:34,045 INFO  L435           NwaCegarLoop]: 121 mSDtfsCounter, 145 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-03 18:52:34,045 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 530 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-03 18:52:34,045 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 138 states.
[2025-03-03 18:52:34,053 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 81.
[2025-03-03 18:52:34,055 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 81 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-03-03 18:52:34,055 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 121 transitions.
[2025-03-03 18:52:34,055 INFO  L78                 Accepts]: Start accepts. Automaton has 81 states and 121 transitions. Word has length 170
[2025-03-03 18:52:34,056 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:52:34,056 INFO  L471      AbstractCegarLoop]: Abstraction has 81 states and 121 transitions.
[2025-03-03 18:52:34,056 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)
[2025-03-03 18:52:34,056 INFO  L276                IsEmpty]: Start isEmpty. Operand 81 states and 121 transitions.
[2025-03-03 18:52:34,057 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2025-03-03 18:52:34,057 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:52:34,057 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:34,057 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-03 18:52:34,057 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:52:34,059 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:52:34,059 INFO  L85        PathProgramCache]: Analyzing trace with hash -1989813343, now seen corresponding path program 1 times
[2025-03-03 18:52:34,059 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:52:34,059 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447855635]
[2025-03-03 18:52:34,059 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:52:34,059 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:52:34,066 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes.
[2025-03-03 18:52:34,083 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements.
[2025-03-03 18:52:34,083 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:52:34,083 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:52:35,610 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-03 18:52:35,610 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:52:35,610 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447855635]
[2025-03-03 18:52:35,610 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447855635] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:52:35,611 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:52:35,611 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-03-03 18:52:35,611 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855886060]
[2025-03-03 18:52:35,611 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:52:35,611 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-03 18:52:35,611 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:52:35,611 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-03 18:52:35,611 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156
[2025-03-03 18:52:35,612 INFO  L87              Difference]: Start difference. First operand 81 states and 121 transitions. Second operand  has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28)
[2025-03-03 18:52:36,986 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:52:36,987 INFO  L93              Difference]: Finished difference Result 284 states and 403 transitions.
[2025-03-03 18:52:36,987 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2025-03-03 18:52:36,987 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 170
[2025-03-03 18:52:36,987 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:52:36,988 INFO  L225             Difference]: With dead ends: 284
[2025-03-03 18:52:36,988 INFO  L226             Difference]: Without dead ends: 282
[2025-03-03 18:52:36,992 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552
[2025-03-03 18:52:36,992 INFO  L435           NwaCegarLoop]: 138 mSDtfsCounter, 427 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-03 18:52:36,993 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 718 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-03 18:52:36,993 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 282 states.
[2025-03-03 18:52:37,002 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 84.
[2025-03-03 18:52:37,003 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-03-03 18:52:37,003 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 126 transitions.
[2025-03-03 18:52:37,003 INFO  L78                 Accepts]: Start accepts. Automaton has 84 states and 126 transitions. Word has length 170
[2025-03-03 18:52:37,004 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:52:37,004 INFO  L471      AbstractCegarLoop]: Abstraction has 84 states and 126 transitions.
[2025-03-03 18:52:37,004 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28)
[2025-03-03 18:52:37,004 INFO  L276                IsEmpty]: Start isEmpty. Operand 84 states and 126 transitions.
[2025-03-03 18:52:37,005 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2025-03-03 18:52:37,005 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:52:37,005 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:37,005 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-03 18:52:37,005 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:52:37,005 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:52:37,005 INFO  L85        PathProgramCache]: Analyzing trace with hash -1961184192, now seen corresponding path program 1 times
[2025-03-03 18:52:37,005 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:52:37,006 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999818567]
[2025-03-03 18:52:37,006 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:52:37,006 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:52:37,011 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes.
[2025-03-03 18:52:37,029 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements.
[2025-03-03 18:52:37,030 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:52:37,030 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:52:40,517 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked.
[2025-03-03 18:52:40,518 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:52:40,518 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999818567]
[2025-03-03 18:52:40,518 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999818567] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:52:40,518 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:52:40,518 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2025-03-03 18:52:40,518 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715889583]
[2025-03-03 18:52:40,518 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:52:40,518 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-03-03 18:52:40,518 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:52:40,519 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-03-03 18:52:40,519 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156
[2025-03-03 18:52:40,519 INFO  L87              Difference]: Start difference. First operand 84 states and 126 transitions. Second operand  has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28)
[2025-03-03 18:52:43,207 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:52:43,207 INFO  L93              Difference]: Finished difference Result 248 states and 357 transitions.
[2025-03-03 18:52:43,207 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2025-03-03 18:52:43,208 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 170
[2025-03-03 18:52:43,208 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:52:43,209 INFO  L225             Difference]: With dead ends: 248
[2025-03-03 18:52:43,209 INFO  L226             Difference]: Without dead ends: 246
[2025-03-03 18:52:43,209 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=252, Invalid=560, Unknown=0, NotChecked=0, Total=812
[2025-03-03 18:52:43,210 INFO  L435           NwaCegarLoop]: 138 mSDtfsCounter, 312 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-03 18:52:43,210 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 768 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-03 18:52:43,210 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 246 states.
[2025-03-03 18:52:43,221 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 80.
[2025-03-03 18:52:43,222 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 80 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-03-03 18:52:43,222 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 119 transitions.
[2025-03-03 18:52:43,223 INFO  L78                 Accepts]: Start accepts. Automaton has 80 states and 119 transitions. Word has length 170
[2025-03-03 18:52:43,225 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:52:43,225 INFO  L471      AbstractCegarLoop]: Abstraction has 80 states and 119 transitions.
[2025-03-03 18:52:43,225 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28)
[2025-03-03 18:52:43,225 INFO  L276                IsEmpty]: Start isEmpty. Operand 80 states and 119 transitions.
[2025-03-03 18:52:43,226 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2025-03-03 18:52:43,226 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:52:43,226 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:43,226 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-03 18:52:43,226 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:52:43,227 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:52:43,227 INFO  L85        PathProgramCache]: Analyzing trace with hash 216482823, now seen corresponding path program 1 times
[2025-03-03 18:52:43,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:52:43,227 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736483202]
[2025-03-03 18:52:43,227 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:52:43,227 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:52:43,233 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes.
[2025-03-03 18:52:43,255 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements.
[2025-03-03 18:52:43,255 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:52:43,255 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:52:43,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked.
[2025-03-03 18:52:43,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-03 18:52:43,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736483202]
[2025-03-03 18:52:43,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736483202] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-03 18:52:43,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953831193]
[2025-03-03 18:52:43,332 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:52:43,332 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:52:43,332 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:52:43,334 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 18:52:43,335 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 18:52:43,374 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes.
[2025-03-03 18:52:43,410 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements.
[2025-03-03 18:52:43,410 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:52:43,410 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:52:43,412 INFO  L256         TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-03-03 18:52:43,415 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:52:43,469 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked.
[2025-03-03 18:52:43,470 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-03 18:52:43,617 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked.
[2025-03-03 18:52:43,617 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953831193] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-03 18:52:43,617 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-03 18:52:43,617 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8
[2025-03-03 18:52:43,617 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895686558]
[2025-03-03 18:52:43,617 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-03 18:52:43,618 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-03 18:52:43,620 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-03 18:52:43,621 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-03 18:52:43,621 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-03-03 18:52:43,621 INFO  L87              Difference]: Start difference. First operand 80 states and 119 transitions. Second operand  has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33)
[2025-03-03 18:52:43,787 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:52:43,788 INFO  L93              Difference]: Finished difference Result 162 states and 239 transitions.
[2025-03-03 18:52:43,788 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-03 18:52:43,788 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 171
[2025-03-03 18:52:43,789 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:52:43,789 INFO  L225             Difference]: With dead ends: 162
[2025-03-03 18:52:43,789 INFO  L226             Difference]: Without dead ends: 85
[2025-03-03 18:52:43,790 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110
[2025-03-03 18:52:43,790 INFO  L435           NwaCegarLoop]: 71 mSDtfsCounter, 128 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-03-03 18:52:43,790 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 157 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-03-03 18:52:43,791 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2025-03-03 18:52:43,798 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77.
[2025-03-03 18:52:43,798 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 77 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-03-03 18:52:43,799 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 110 transitions.
[2025-03-03 18:52:43,799 INFO  L78                 Accepts]: Start accepts. Automaton has 77 states and 110 transitions. Word has length 171
[2025-03-03 18:52:43,799 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:52:43,799 INFO  L471      AbstractCegarLoop]: Abstraction has 77 states and 110 transitions.
[2025-03-03 18:52:43,800 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33)
[2025-03-03 18:52:43,800 INFO  L276                IsEmpty]: Start isEmpty. Operand 77 states and 110 transitions.
[2025-03-03 18:52:43,800 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 173
[2025-03-03 18:52:43,800 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:52:43,800 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:43,807 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-03 18:52:44,001 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,SelfDestructingSolverStorable7
[2025-03-03 18:52:44,002 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:52:44,002 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:52:44,002 INFO  L85        PathProgramCache]: Analyzing trace with hash -1849352866, now seen corresponding path program 1 times
[2025-03-03 18:52:44,002 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-03 18:52:44,002 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756068887]
[2025-03-03 18:52:44,002 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:52:44,002 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-03 18:52:44,008 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes.
[2025-03-03 18:52:44,035 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements.
[2025-03-03 18:52:44,035 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:52:44,035 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-03-03 18:52:44,037 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1994974545]
[2025-03-03 18:52:44,037 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:52:44,037 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:52:44,037 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:52:44,039 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 18:52:44,041 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 18:52:44,083 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes.
[2025-03-03 18:52:44,321 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements.
[2025-03-03 18:52:44,321 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:52:44,321 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-03 18:52:44,321 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-03 18:52:44,334 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes.
[2025-03-03 18:52:44,353 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements.
[2025-03-03 18:52:44,353 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:52:44,353 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-03 18:52:44,416 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-03 18:52:44,417 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-03 18:52:44,418 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-03 18:52:44,424 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-03 18:52:44,619 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-03 18:52:44,622 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-03 18:52:44,692 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-03 18:52:44,694 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:52:44 BoogieIcfgContainer
[2025-03-03 18:52:44,694 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-03 18:52:44,695 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-03 18:52:44,695 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-03 18:52:44,695 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-03 18:52:44,696 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:52:17" (3/4) ...
[2025-03-03 18:52:44,697 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-03-03 18:52:44,697 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-03 18:52:44,699 INFO  L158              Benchmark]: Toolchain (without parser) took 27975.46ms. Allocated memory was 167.8MB in the beginning and 620.8MB in the end (delta: 453.0MB). Free memory was 122.2MB in the beginning and 289.5MB in the end (delta: -167.3MB). Peak memory consumption was 280.7MB. Max. memory is 16.1GB.
[2025-03-03 18:52:44,699 INFO  L158              Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 18:52:44,699 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 226.54ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 107.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-03 18:52:44,700 INFO  L158              Benchmark]: Boogie Procedure Inliner took 35.59ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 104.2MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 18:52:44,700 INFO  L158              Benchmark]: Boogie Preprocessor took 47.19ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 99.0MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-03 18:52:44,700 INFO  L158              Benchmark]: IcfgBuilder took 384.75ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 75.7MB in the end (delta: 23.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-03 18:52:44,700 INFO  L158              Benchmark]: TraceAbstraction took 27272.47ms. Allocated memory was 167.8MB in the beginning and 620.8MB in the end (delta: 453.0MB). Free memory was 75.2MB in the beginning and 289.5MB in the end (delta: -214.3MB). Peak memory consumption was 238.7MB. Max. memory is 16.1GB.
[2025-03-03 18:52:44,701 INFO  L158              Benchmark]: Witness Printer took 2.45ms. Allocated memory is still 620.8MB. Free memory is still 289.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-03 18:52:44,702 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 226.54ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 107.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 35.59ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 104.2MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 47.19ms. Allocated memory is still 167.8MB. Free memory was 104.2MB in the beginning and 99.0MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 384.75ms. Allocated memory is still 167.8MB. Free memory was 99.0MB in the beginning and 75.7MB in the end (delta: 23.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * TraceAbstraction took 27272.47ms. Allocated memory was 167.8MB in the beginning and 620.8MB in the end (delta: 453.0MB). Free memory was 75.2MB in the beginning and 289.5MB in the end (delta: -214.3MB). Peak memory consumption was 238.7MB. Max. memory is 16.1GB.
 * Witness Printer took 2.45ms. Allocated memory is still 620.8MB. Free memory is still 289.5MB. 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 132, overapproximation of someBinaryFLOATComparisonOperation at line 137. 
Possible FailurePath: 
[L21]                    unsigned char isInitial = 0;
[L22]                    unsigned char var_1_1 = 0;
[L23]                    unsigned char var_1_2 = 25;
[L24]                    unsigned char var_1_3 = 16;
[L25]                    unsigned char var_1_4 = 4;
[L26]                    unsigned char var_1_5 = 200;
[L27]                    unsigned char var_1_6 = 1;
[L28]                    unsigned char var_1_7 = 0;
[L29]                    unsigned char var_1_8 = 0;
[L30]                    unsigned char var_1_9 = 0;
[L31]                    signed short int var_1_10 = 128;
[L32]                    signed short int var_1_11 = 5;
[L33]                    signed char var_1_12 = -2;
[L34]                    signed char var_1_13 = -32;
[L35]                    signed char var_1_14 = 2;
[L36]                    signed char var_1_15 = 25;
[L37]                    signed char var_1_16 = 1;
[L38]                    signed char var_1_17 = 0;
[L39]                    signed long int var_1_18 = -16;
[L40]                    float var_1_19 = 2.775;
[L41]                    unsigned long int var_1_20 = 2381110720;
[L42]                    float var_1_21 = 10000000000000.5;
             VAL         [isInitial=0, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_2=25, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L141]                   isInitial = 1
[L142]       FCALL       initially()
[L143]       COND TRUE   1
[L144]       FCALL       updateLastVariables()
[L145]       CALL        updateVariables()
[L91]                    var_1_2 = __VERIFIER_nondet_uchar()
[L92]        CALL        assume_abort_if_not(var_1_2 >= 0)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L92]        RET         assume_abort_if_not(var_1_2 >= 0)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L93]        CALL        assume_abort_if_not(var_1_2 <= 255)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L93]        RET         assume_abort_if_not(var_1_2 <= 255)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L94]                    var_1_3 = __VERIFIER_nondet_uchar()
[L95]        CALL        assume_abort_if_not(var_1_3 >= 0)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L95]        RET         assume_abort_if_not(var_1_3 >= 0)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L96]        CALL        assume_abort_if_not(var_1_3 <= 255)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L96]        RET         assume_abort_if_not(var_1_3 <= 255)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L97]        CALL        assume_abort_if_not(var_1_3 != 0)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L97]        RET         assume_abort_if_not(var_1_3 != 0)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L98]                    var_1_4 = __VERIFIER_nondet_uchar()
[L99]        CALL        assume_abort_if_not(var_1_4 >= 0)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L99]        RET         assume_abort_if_not(var_1_4 >= 0)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L100]       CALL        assume_abort_if_not(var_1_4 <= 255)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L100]       RET         assume_abort_if_not(var_1_4 <= 255)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L101]                   var_1_5 = __VERIFIER_nondet_uchar()
[L102]       CALL        assume_abort_if_not(var_1_5 >= 0)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L102]       RET         assume_abort_if_not(var_1_5 >= 0)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L103]       CALL        assume_abort_if_not(var_1_5 <= 254)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L103]       RET         assume_abort_if_not(var_1_5 <= 254)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0]
[L104]                   var_1_6 = __VERIFIER_nondet_uchar()
[L105]       CALL        assume_abort_if_not(var_1_6 >= 0)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0]
[L105]       RET         assume_abort_if_not(var_1_6 >= 0)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_7=0, var_1_8=0, var_1_9=0]
[L106]       CALL        assume_abort_if_not(var_1_6 <= 1)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0]
[L106]       RET         assume_abort_if_not(var_1_6 <= 1)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0]
[L107]                   var_1_7 = __VERIFIER_nondet_uchar()
[L108]       CALL        assume_abort_if_not(var_1_7 >= 0)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=0]
[L108]       RET         assume_abort_if_not(var_1_7 >= 0)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_8=0, var_1_9=0]
[L109]       CALL        assume_abort_if_not(var_1_7 <= 1)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0]
[L109]       RET         assume_abort_if_not(var_1_7 <= 1)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0]
[L110]                   var_1_8 = __VERIFIER_nondet_uchar()
[L111]       CALL        assume_abort_if_not(var_1_8 >= 0)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=0]
[L111]       RET         assume_abort_if_not(var_1_8 >= 0)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=0]
[L112]       CALL        assume_abort_if_not(var_1_8 <= 1)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=0]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=0]
[L112]       RET         assume_abort_if_not(var_1_8 <= 1)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=0]
[L113]                   var_1_9 = __VERIFIER_nondet_uchar()
[L114]       CALL        assume_abort_if_not(var_1_9 >= 0)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1]
[L114]       RET         assume_abort_if_not(var_1_9 >= 0)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1]
[L115]       CALL        assume_abort_if_not(var_1_9 <= 1)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L115]       RET         assume_abort_if_not(var_1_9 <= 1)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L116]                   var_1_13 = __VERIFIER_nondet_char()
[L117]       CALL        assume_abort_if_not(var_1_13 >= -127)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L117]       RET         assume_abort_if_not(var_1_13 >= -127)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L118]       CALL        assume_abort_if_not(var_1_13 <= 126)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L118]       RET         assume_abort_if_not(var_1_13 <= 126)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L119]                   var_1_14 = __VERIFIER_nondet_char()
[L120]       CALL        assume_abort_if_not(var_1_14 >= -127)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L120]       RET         assume_abort_if_not(var_1_14 >= -127)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L121]       CALL        assume_abort_if_not(var_1_14 <= 126)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L121]       RET         assume_abort_if_not(var_1_14 <= 126)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L122]                   var_1_16 = __VERIFIER_nondet_char()
[L123]       CALL        assume_abort_if_not(var_1_16 >= 0)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L123]       RET         assume_abort_if_not(var_1_16 >= 0)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L124]       CALL        assume_abort_if_not(var_1_16 <= 63)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L124]       RET         assume_abort_if_not(var_1_16 <= 63)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L125]                   var_1_17 = __VERIFIER_nondet_char()
[L126]       CALL        assume_abort_if_not(var_1_17 >= 0)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L126]       RET         assume_abort_if_not(var_1_17 >= 0)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L127]       CALL        assume_abort_if_not(var_1_17 <= 126)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L127]       RET         assume_abort_if_not(var_1_17 <= 126)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L128]                   var_1_20 = __VERIFIER_nondet_ulong()
[L129]       CALL        assume_abort_if_not(var_1_20 >= 2147483647)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L129]       RET         assume_abort_if_not(var_1_20 >= 2147483647)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L130]       CALL        assume_abort_if_not(var_1_20 <= 4294967295)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L130]       RET         assume_abort_if_not(var_1_20 <= 4294967295)
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_21=20000000000001/2, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L131]                   var_1_21 = __VERIFIER_nondet_float()
[L132]       CALL        assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F ))
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L20]        COND FALSE  !(!cond)
             VAL         [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L132]       RET         assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F ))
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L145]       RET         updateVariables()
[L146]       CALL        step()
[L46]        COND FALSE  !((var_1_2 / var_1_3) <= 2)
[L57]                    var_1_1 = var_1_5
             VAL         [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L59]        COND TRUE   var_1_3 <= var_1_2
[L60]                    var_1_10 = ((((var_1_5) < (var_1_3)) ? (var_1_5) : (var_1_3)))
             VAL         [isInitial=1, var_1_10=0, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L62]        COND TRUE   var_1_1 >= (((((var_1_2) < (var_1_10)) ? (var_1_2) : (var_1_10))) + var_1_5)
[L63]                    var_1_11 = ((var_1_5 + var_1_2) + var_1_3)
             VAL         [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L69]                    var_1_12 = ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))
             VAL         [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L70]        COND TRUE   \read(var_1_7)
[L71]                    var_1_15 = (((((32) < ((16 + var_1_16))) ? (32) : ((16 + var_1_16)))) - var_1_17)
             VAL         [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L73]        COND TRUE   var_1_16 <= ((((var_1_13) > (var_1_3)) ? (var_1_13) : (var_1_3)))
[L74]                    var_1_18 = (((((64 - var_1_16)) > (var_1_17)) ? ((64 - var_1_16)) : (var_1_17)))
             VAL         [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L78]        COND TRUE   100000000u < (((((4160981528u) < (var_1_20)) ? (4160981528u) : (var_1_20))) - var_1_1)
             VAL         [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L79]        COND TRUE   var_1_20 > 1u
             VAL         [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=111/40, var_1_1=0, var_1_20=-2147483649, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L80]        COND TRUE   \read(var_1_9)
[L81]                    var_1_19 = var_1_21
             VAL         [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=0, var_1_20=-2147483649, var_1_21=2, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L146]       RET         step()
[L147]       CALL, EXPR  property()
[L137-L138]              return ((((((((var_1_2 / var_1_3) <= 2) ? ((var_1_3 < (((((~ var_1_2)) < (var_1_4)) ? ((~ var_1_2)) : (var_1_4)))) ? (var_1_1 == ((unsigned char) ((((var_1_5) < (16)) ? (var_1_5) : (16))))) : ((((var_1_6 || var_1_7) && var_1_8) || var_1_9) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_5)))) : (var_1_1 == ((unsigned char) var_1_5))) && ((var_1_3 <= var_1_2) ? (var_1_10 == ((signed short int) ((((var_1_5) < (var_1_3)) ? (var_1_5) : (var_1_3))))) : 1)) && ((var_1_1 >= (((((var_1_2) < (var_1_10)) ? (var_1_2) : (var_1_10))) + var_1_5)) ? (var_1_11 == ((signed short int) ((var_1_5 + var_1_2) + var_1_3))) : (var_1_8 ? (var_1_11 == ((signed short int) var_1_3)) : 1))) && (var_1_12 == ((signed char) ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) && (var_1_7 ? (var_1_15 == ((signed char) (((((32) < ((16 + var_1_16))) ? (32) : ((16 + var_1_16)))) - var_1_17))) : 1)) && ((var_1_16 <= ((((var_1_13) > (var_1_3)) ? (var_1_13) : (var_1_3)))) ? (var_1_18 == ((signed long int) (((((64 - var_1_16)) > (var_1_17)) ? ((64 - var_1_16)) : (var_1_17))))) : (var_1_18 == ((signed long int) 4)))) && ((100000000u < (((((4160981528u) < (var_1_20)) ? (4160981528u) : (var_1_20))) - var_1_1)) ? ((var_1_20 > 1u) ? (var_1_9 ? (var_1_19 == ((float) var_1_21)) : (var_1_19 == ((float) var_1_21))) : (var_1_19 == ((float) var_1_21))) : 1)
;
             VAL         [\result=0, isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=0, var_1_20=-2147483649, var_1_21=2, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L147]       RET, EXPR   property()
[L147]       CALL        __VERIFIER_assert(property())
[L19]        COND TRUE   !(cond)
             VAL         [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=0, var_1_20=-2147483649, var_1_21=2, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]
[L19]                    reach_error()
             VAL         [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=0, var_1_20=-2147483649, var_1_21=2, var_1_2=255, var_1_3=32597, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.2s, OverallIterations: 9, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1552 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1527 mSDsluCounter, 4021 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3090 mSDsCounter, 185 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1510 IncrementalHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 185 mSolverCounterUnsat, 931 mSDtfsCounter, 1510 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 643 GetRequests, 535 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=2, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 619 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 18.8s InterpolantComputationTime, 2046 NumberOfCodeBlocks, 2046 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1862 ConstructedInterpolants, 0 QuantifiedInterpolants, 8706 SizeOfPredicates, 0 NumberOfNonLiveVariables, 745 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 16560/16632 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 18:52:44,846 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

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

### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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_codestructure_normal_file-58.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 96b38d981ab2c29d6aa004a84880ce68546a2e4edd87db11e524adc2046dd497
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-798a7b3-m
[2025-03-03 18:52:46,454 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-03 18:52:46,515 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2025-03-03 18:52:46,524 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-03 18:52:46,524 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-03 18:52:46,549 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-03 18:52:46,550 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-03 18:52:46,550 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-03 18:52:46,550 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-03 18:52:46,550 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-03 18:52:46,550 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-03 18:52:46,550 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-03 18:52:46,550 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-03 18:52:46,550 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-03 18:52:46,550 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-03 18:52:46,551 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-03 18:52:46,551 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-03 18:52:46,551 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-03 18:52:46,551 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-03 18:52:46,551 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-03 18:52:46,551 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-03 18:52:46,551 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-03 18:52:46,551 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-03 18:52:46,551 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-03-03 18:52:46,551 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-03-03 18:52:46,551 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-03-03 18:52:46,551 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-03 18:52:46,551 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-03 18:52:46,551 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-03 18:52:46,551 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-03 18:52:46,551 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-03 18:52:46,551 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-03 18:52:46,551 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-03 18:52:46,552 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-03 18:52:46,552 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 18:52:46,552 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-03 18:52:46,552 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-03 18:52:46,552 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-03 18:52:46,552 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-03 18:52:46,552 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-03-03 18:52:46,552 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-03-03 18:52:46,552 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-03 18:52:46,554 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-03 18:52:46,554 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-03 18:52:46,554 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-03 18:52:46,554 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 -> 96b38d981ab2c29d6aa004a84880ce68546a2e4edd87db11e524adc2046dd497
[2025-03-03 18:52:46,790 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-03 18:52:46,795 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-03 18:52:46,797 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-03 18:52:46,799 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-03 18:52:46,799 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-03 18:52:46,801 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.i
[2025-03-03 18:52:47,957 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d2f099ab/7d0fad39b7da4e2786e9f6ef926f6dcd/FLAG767457295
[2025-03-03 18:52:48,183 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-03 18:52:48,184 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-58.i
[2025-03-03 18:52:48,190 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d2f099ab/7d0fad39b7da4e2786e9f6ef926f6dcd/FLAG767457295
[2025-03-03 18:52:48,199 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d2f099ab/7d0fad39b7da4e2786e9f6ef926f6dcd
[2025-03-03 18:52:48,201 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-03 18:52:48,202 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-03 18:52:48,203 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-03 18:52:48,203 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-03 18:52:48,205 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-03 18:52:48,206 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:52:48" (1/1) ...
[2025-03-03 18:52:48,206 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d710469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:48, skipping insertion in model container
[2025-03-03 18:52:48,206 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:52:48" (1/1) ...
[2025-03-03 18:52:48,221 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-03 18:52:48,308 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_codestructure_normal_file-58.i[913,926]
[2025-03-03 18:52:48,347 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 18:52:48,357 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-03 18:52:48,366 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_codestructure_normal_file-58.i[913,926]
[2025-03-03 18:52:48,386 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-03 18:52:48,397 INFO  L204         MainTranslator]: Completed translation
[2025-03-03 18:52:48,398 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:48 WrapperNode
[2025-03-03 18:52:48,398 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-03 18:52:48,399 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-03 18:52:48,400 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-03 18:52:48,400 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-03 18:52:48,404 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:48" (1/1) ...
[2025-03-03 18:52:48,417 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:48" (1/1) ...
[2025-03-03 18:52:48,435 INFO  L138                Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147
[2025-03-03 18:52:48,439 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-03 18:52:48,440 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-03 18:52:48,440 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-03 18:52:48,440 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-03 18:52:48,447 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:48" (1/1) ...
[2025-03-03 18:52:48,447 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:48" (1/1) ...
[2025-03-03 18:52:48,451 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:48" (1/1) ...
[2025-03-03 18:52:48,463 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 18:52:48,468 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:48" (1/1) ...
[2025-03-03 18:52:48,468 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:48" (1/1) ...
[2025-03-03 18:52:48,479 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:48" (1/1) ...
[2025-03-03 18:52:48,480 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:48" (1/1) ...
[2025-03-03 18:52:48,485 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:48" (1/1) ...
[2025-03-03 18:52:48,486 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:48" (1/1) ...
[2025-03-03 18:52:48,487 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-03 18:52:48,492 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-03 18:52:48,492 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-03 18:52:48,492 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-03 18:52:48,493 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:48" (1/1) ...
[2025-03-03 18:52:48,497 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-03 18:52:48,510 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-03 18:52:48,519 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 18:52:48,522 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 18:52:48,538 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-03 18:52:48,539 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-03-03 18:52:48,539 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-03 18:52:48,539 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-03 18:52:48,539 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-03 18:52:48,539 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-03 18:52:48,596 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-03 18:52:48,597 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-03 18:52:48,830 INFO  L?                        ?]: Removed 8 outVars from TransFormulas that were not future-live.
[2025-03-03 18:52:48,830 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-03 18:52:48,839 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-03 18:52:48,839 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-03 18:52:48,839 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:52:48 BoogieIcfgContainer
[2025-03-03 18:52:48,839 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-03 18:52:48,841 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-03 18:52:48,841 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-03 18:52:48,845 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-03 18:52:48,846 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:52:48" (1/3) ...
[2025-03-03 18:52:48,846 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493a254d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:52:48, skipping insertion in model container
[2025-03-03 18:52:48,846 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:48" (2/3) ...
[2025-03-03 18:52:48,847 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493a254d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:52:48, skipping insertion in model container
[2025-03-03 18:52:48,847 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:52:48" (3/3) ...
[2025-03-03 18:52:48,848 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-58.i
[2025-03-03 18:52:48,857 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-03 18:52:48,859 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-58.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-03 18:52:48,895 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-03 18:52:48,905 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;@1d617a94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-03 18:52:48,907 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-03 18:52:48,910 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-03-03 18:52:48,918 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2025-03-03 18:52:48,919 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:52:48,919 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:48,919 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:52:48,923 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:52:48,923 INFO  L85        PathProgramCache]: Analyzing trace with hash 318885378, now seen corresponding path program 1 times
[2025-03-03 18:52:48,930 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 18:52:48,930 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697438150]
[2025-03-03 18:52:48,930 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:52:48,931 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 18:52:48,931 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 18:52:48,933 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 18:52:48,934 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 18:52:49,008 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes.
[2025-03-03 18:52:49,123 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements.
[2025-03-03 18:52:49,124 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:52:49,124 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:52:49,130 INFO  L256         TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-03 18:52:49,138 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-03 18:52:49,177 INFO  L134       CoverageAnalysis]: Checked inductivity of 1512 backedges. 662 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked.
[2025-03-03 18:52:49,177 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-03 18:52:49,177 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-03 18:52:49,177 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697438150]
[2025-03-03 18:52:49,178 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [697438150] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-03 18:52:49,178 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-03 18:52:49,178 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-03 18:52:49,179 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788522383]
[2025-03-03 18:52:49,180 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-03 18:52:49,182 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-03 18:52:49,182 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-03 18:52:49,198 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-03 18:52:49,198 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-03 18:52:49,200 INFO  L87              Difference]: Start difference. First operand  has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28)
[2025-03-03 18:52:49,222 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-03 18:52:49,224 INFO  L93              Difference]: Finished difference Result 138 states and 247 transitions.
[2025-03-03 18:52:49,225 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-03 18:52:49,226 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 170
[2025-03-03 18:52:49,227 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-03 18:52:49,231 INFO  L225             Difference]: With dead ends: 138
[2025-03-03 18:52:49,232 INFO  L226             Difference]: Without dead ends: 69
[2025-03-03 18:52:49,235 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 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 18:52:49,238 INFO  L435           NwaCegarLoop]: 106 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, 106 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 18:52:49,238 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-03 18:52:49,248 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2025-03-03 18:52:49,270 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69.
[2025-03-03 18:52:49,273 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 69 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28)
[2025-03-03 18:52:49,275 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 106 transitions.
[2025-03-03 18:52:49,279 INFO  L78                 Accepts]: Start accepts. Automaton has 69 states and 106 transitions. Word has length 170
[2025-03-03 18:52:49,279 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-03 18:52:49,279 INFO  L471      AbstractCegarLoop]: Abstraction has 69 states and 106 transitions.
[2025-03-03 18:52:49,279 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28)
[2025-03-03 18:52:49,280 INFO  L276                IsEmpty]: Start isEmpty. Operand 69 states and 106 transitions.
[2025-03-03 18:52:49,282 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2025-03-03 18:52:49,283 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-03 18:52:49,283 INFO  L218           NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:52:49,290 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 18:52:49,483 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 18:52:49,483 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-03 18:52:49,484 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-03 18:52:49,484 INFO  L85        PathProgramCache]: Analyzing trace with hash -1793299838, now seen corresponding path program 1 times
[2025-03-03 18:52:49,485 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-03 18:52:49,485 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913662010]
[2025-03-03 18:52:49,485 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-03 18:52:49,485 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 18:52:49,485 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-03 18:52:49,487 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 18:52:49,489 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 18:52:49,536 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes.
[2025-03-03 18:52:49,627 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements.
[2025-03-03 18:52:49,627 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-03 18:52:49,627 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-03 18:52:49,631 INFO  L256         TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 15 conjuncts are in the unsatisfiable core
[2025-03-03 18:52:49,641 INFO  L279         TraceCheckSpWp]: Computing forward predicates...