./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-42.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_fillercode_fillercodesize_ps-cn-50_file-42.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 c43b6c6bf1e929a2c5ffb78cc7ba63d9bb07f6da61e5bcfce9d1a73030d3f75b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:17:19,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:17:19,805 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:17:19,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:17:19,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:17:19,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:17:19,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:17:19,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:17:19,836 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:17:19,836 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:17:19,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:17:19,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:17:19,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:17:19,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:17:19,838 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:17:19,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:17:19,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:17:19,838 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:17:19,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:17:19,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:17:19,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:17:19,838 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:17:19,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:17:19,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:17:19,839 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:17:19,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:17:19,839 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:17:19,839 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:17:19,839 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:17:19,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:17:19,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:17:19,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:17:19,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:17:19,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:17:19,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:17:19,840 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:17:19,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:17:19,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:17:19,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:17:19,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:17:19,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:17:19,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:17:19,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:17:19,841 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 -> c43b6c6bf1e929a2c5ffb78cc7ba63d9bb07f6da61e5bcfce9d1a73030d3f75b [2025-03-03 20:17:20,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:17:20,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:17:20,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:17:20,089 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:17:20,089 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:17:20,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-42.i [2025-03-03 20:17:21,251 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/852ec3f73/693a10e2888f4b599fc3bfdba3a94337/FLAG0a582d94e [2025-03-03 20:17:21,507 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:17:21,508 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-42.i [2025-03-03 20:17:21,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/852ec3f73/693a10e2888f4b599fc3bfdba3a94337/FLAG0a582d94e [2025-03-03 20:17:21,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/852ec3f73/693a10e2888f4b599fc3bfdba3a94337 [2025-03-03 20:17:21,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:17:21,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:17:21,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:17:21,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:17:21,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:17:21,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:17:21" (1/1) ... [2025-03-03 20:17:21,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d165a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:21, skipping insertion in model container [2025-03-03 20:17:21,838 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:17:21" (1/1) ... [2025-03-03 20:17:21,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:17:21,948 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_fillercode_fillercodesize_ps-cn-50_file-42.i[915,928] [2025-03-03 20:17:21,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:17:22,007 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:17:22,014 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_fillercode_fillercodesize_ps-cn-50_file-42.i[915,928] [2025-03-03 20:17:22,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:17:22,065 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:17:22,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:22 WrapperNode [2025-03-03 20:17:22,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:17:22,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:17:22,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:17:22,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:17:22,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:22" (1/1) ... [2025-03-03 20:17:22,080 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:22" (1/1) ... [2025-03-03 20:17:22,109 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 230 [2025-03-03 20:17:22,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:17:22,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:17:22,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:17:22,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:17:22,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:22" (1/1) ... [2025-03-03 20:17:22,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:22" (1/1) ... [2025-03-03 20:17:22,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:22" (1/1) ... [2025-03-03 20:17:22,143 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 20:17:22,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:22" (1/1) ... [2025-03-03 20:17:22,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:22" (1/1) ... [2025-03-03 20:17:22,157 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:22" (1/1) ... [2025-03-03 20:17:22,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:22" (1/1) ... [2025-03-03 20:17:22,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:22" (1/1) ... [2025-03-03 20:17:22,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:22" (1/1) ... [2025-03-03 20:17:22,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:17:22,174 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:17:22,175 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:17:22,175 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:17:22,176 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:22" (1/1) ... [2025-03-03 20:17:22,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:17:22,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:17:22,206 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 20:17:22,209 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 20:17:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:17:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:17:22,227 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:17:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:17:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:17:22,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:17:22,312 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:17:22,314 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:17:22,749 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 20:17:22,749 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:17:22,761 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:17:22,761 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:17:22,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:17:22 BoogieIcfgContainer [2025-03-03 20:17:22,762 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:17:22,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:17:22,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:17:22,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:17:22,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:17:21" (1/3) ... [2025-03-03 20:17:22,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311ad7fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:17:22, skipping insertion in model container [2025-03-03 20:17:22,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:22" (2/3) ... [2025-03-03 20:17:22,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311ad7fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:17:22, skipping insertion in model container [2025-03-03 20:17:22,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:17:22" (3/3) ... [2025-03-03 20:17:22,770 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-42.i [2025-03-03 20:17:22,785 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:17:22,787 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-42.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:17:22,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:17:22,843 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;@4bf4347, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:17:22,843 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:17:22,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 20:17:22,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 20:17:22,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:17:22,860 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:22,861 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:17:22,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:17:22,865 INFO L85 PathProgramCache]: Analyzing trace with hash -376507049, now seen corresponding path program 1 times [2025-03-03 20:17:22,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:17:22,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767720858] [2025-03-03 20:17:22,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:22,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:17:22,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 20:17:22,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 20:17:22,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:22,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2025-03-03 20:17:23,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:17:23,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767720858] [2025-03-03 20:17:23,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767720858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:17:23,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477349134] [2025-03-03 20:17:23,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:23,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:17:23,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:17:23,180 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 20:17:23,203 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 20:17:23,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 20:17:23,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 20:17:23,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:23,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:23,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:17:23,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:17:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2025-03-03 20:17:23,439 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:17:23,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477349134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:17:23,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:17:23,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:17:23,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609678510] [2025-03-03 20:17:23,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:17:23,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:17:23,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:17:23,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:17:23,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:17:23,462 INFO L87 Difference]: Start difference. First operand has 101 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 20:17:23,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:17:23,483 INFO L93 Difference]: Finished difference Result 195 states and 350 transitions. [2025-03-03 20:17:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:17:23,485 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) Word has length 235 [2025-03-03 20:17:23,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:17:23,493 INFO L225 Difference]: With dead ends: 195 [2025-03-03 20:17:23,493 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 20:17:23,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 236 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 20:17:23,497 INFO L435 NwaCegarLoop]: 152 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, 152 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 20:17:23,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:17:23,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 20:17:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-03 20:17:23,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 20:17:23,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 152 transitions. [2025-03-03 20:17:23,536 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 152 transitions. Word has length 235 [2025-03-03 20:17:23,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:17:23,537 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 152 transitions. [2025-03-03 20:17:23,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 20:17:23,537 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 152 transitions. [2025-03-03 20:17:23,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 20:17:23,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:17:23,540 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:23,547 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 20:17:23,743 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 20:17:23,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:17:23,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:17:23,745 INFO L85 PathProgramCache]: Analyzing trace with hash -266057512, now seen corresponding path program 1 times [2025-03-03 20:17:23,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:17:23,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22792111] [2025-03-03 20:17:23,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:23,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:17:23,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 20:17:23,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 20:17:23,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:23,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-03 20:17:23,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:17:23,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22792111] [2025-03-03 20:17:23,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22792111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:17:23,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:17:23,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:17:23,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983597139] [2025-03-03 20:17:23,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:17:23,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:17:23,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:17:23,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:17:23,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:17:23,971 INFO L87 Difference]: Start difference. First operand 97 states and 152 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 20:17:24,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:17:24,021 INFO L93 Difference]: Finished difference Result 250 states and 390 transitions. [2025-03-03 20:17:24,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:17:24,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 235 [2025-03-03 20:17:24,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:17:24,027 INFO L225 Difference]: With dead ends: 250 [2025-03-03 20:17:24,027 INFO L226 Difference]: Without dead ends: 156 [2025-03-03 20:17:24,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:17:24,030 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 87 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:17:24,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 345 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:17:24,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-03 20:17:24,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2025-03-03 20:17:24,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 96 states have internal predecessors, (128), 55 states have call successors, (55), 2 states have call predecessors, (55), 2 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-03 20:17:24,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 238 transitions. [2025-03-03 20:17:24,088 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 238 transitions. Word has length 235 [2025-03-03 20:17:24,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:17:24,088 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 238 transitions. [2025-03-03 20:17:24,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 20:17:24,089 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 238 transitions. [2025-03-03 20:17:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 20:17:24,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:17:24,095 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:24,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:17:24,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:17:24,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:17:24,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1110529383, now seen corresponding path program 1 times [2025-03-03 20:17:24,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:17:24,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958928066] [2025-03-03 20:17:24,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:24,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:17:24,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 20:17:24,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 20:17:24,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:24,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-03 20:17:24,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:17:24,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958928066] [2025-03-03 20:17:24,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958928066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:17:24,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:17:24,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:17:24,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608935603] [2025-03-03 20:17:24,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:17:24,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:17:24,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:17:24,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:17:24,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:17:24,543 INFO L87 Difference]: Start difference. First operand 153 states and 238 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 20:17:24,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:17:24,754 INFO L93 Difference]: Finished difference Result 422 states and 660 transitions. [2025-03-03 20:17:24,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:17:24,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 235 [2025-03-03 20:17:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:17:24,762 INFO L225 Difference]: With dead ends: 422 [2025-03-03 20:17:24,763 INFO L226 Difference]: Without dead ends: 272 [2025-03-03 20:17:24,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:17:24,766 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 109 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:17:24,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 438 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:17:24,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-03 20:17:24,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 232. [2025-03-03 20:17:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 137 states have internal predecessors, (178), 92 states have call successors, (92), 3 states have call predecessors, (92), 3 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-03 20:17:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 362 transitions. [2025-03-03 20:17:24,814 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 362 transitions. Word has length 235 [2025-03-03 20:17:24,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:17:24,815 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 362 transitions. [2025-03-03 20:17:24,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 20:17:24,815 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 362 transitions. [2025-03-03 20:17:24,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 20:17:24,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:17:24,818 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:24,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:17:24,818 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:17:24,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:17:24,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1719041994, now seen corresponding path program 1 times [2025-03-03 20:17:24,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:17:24,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830324195] [2025-03-03 20:17:24,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:24,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:17:24,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 20:17:24,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 20:17:24,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:24,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:25,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-03 20:17:25,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:17:25,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830324195] [2025-03-03 20:17:25,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830324195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:17:25,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:17:25,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:17:25,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006532089] [2025-03-03 20:17:25,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:17:25,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:17:25,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:17:25,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:17:25,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:17:25,245 INFO L87 Difference]: Start difference. First operand 232 states and 362 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 20:17:25,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:17:25,638 INFO L93 Difference]: Finished difference Result 618 states and 965 transitions. [2025-03-03 20:17:25,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:17:25,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 236 [2025-03-03 20:17:25,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:17:25,644 INFO L225 Difference]: With dead ends: 618 [2025-03-03 20:17:25,644 INFO L226 Difference]: Without dead ends: 468 [2025-03-03 20:17:25,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:17:25,647 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 139 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:17:25,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 567 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:17:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-03 20:17:25,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 380. [2025-03-03 20:17:25,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 227 states have (on average 1.3215859030837005) internal successors, (300), 229 states have internal predecessors, (300), 147 states have call successors, (147), 5 states have call predecessors, (147), 5 states have return successors, (147), 145 states have call predecessors, (147), 147 states have call successors, (147) [2025-03-03 20:17:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2025-03-03 20:17:25,726 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 236 [2025-03-03 20:17:25,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:17:25,727 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2025-03-03 20:17:25,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 20:17:25,727 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2025-03-03 20:17:25,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 20:17:25,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:17:25,729 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:25,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:17:25,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:17:25,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:17:25,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1068373493, now seen corresponding path program 1 times [2025-03-03 20:17:25,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:17:25,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500288325] [2025-03-03 20:17:25,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:25,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:17:25,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 20:17:25,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 20:17:25,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:25,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-03 20:17:25,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:17:25,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500288325] [2025-03-03 20:17:25,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500288325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:17:25,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:17:25,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:17:25,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044918179] [2025-03-03 20:17:25,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:17:25,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:17:25,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:17:25,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:17:25,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:17:25,927 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 20:17:25,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:17:25,993 INFO L93 Difference]: Finished difference Result 678 states and 1061 transitions. [2025-03-03 20:17:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:17:25,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 236 [2025-03-03 20:17:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:17:26,003 INFO L225 Difference]: With dead ends: 678 [2025-03-03 20:17:26,003 INFO L226 Difference]: Without dead ends: 380 [2025-03-03 20:17:26,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:17:26,004 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:17:26,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:17:26,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-03 20:17:26,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-03-03 20:17:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 227 states have (on average 1.303964757709251) internal successors, (296), 229 states have internal predecessors, (296), 147 states have call successors, (147), 5 states have call predecessors, (147), 5 states have return successors, (147), 145 states have call predecessors, (147), 147 states have call successors, (147) [2025-03-03 20:17:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 590 transitions. [2025-03-03 20:17:26,057 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 590 transitions. Word has length 236 [2025-03-03 20:17:26,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:17:26,057 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 590 transitions. [2025-03-03 20:17:26,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 20:17:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 590 transitions. [2025-03-03 20:17:26,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 20:17:26,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:17:26,059 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:26,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:17:26,059 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:17:26,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:17:26,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1419139340, now seen corresponding path program 1 times [2025-03-03 20:17:26,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:17:26,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080974158] [2025-03-03 20:17:26,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:26,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:17:26,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 20:17:26,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 20:17:26,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:26,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 54 proven. 54 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-03 20:17:26,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:17:26,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080974158] [2025-03-03 20:17:26,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080974158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:17:26,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081203237] [2025-03-03 20:17:26,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:26,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:17:26,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:17:26,307 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 20:17:26,309 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 20:17:26,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 20:17:26,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 20:17:26,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:26,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:26,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:17:26,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:17:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1368 proven. 54 refuted. 0 times theorem prover too weak. 1242 trivial. 0 not checked. [2025-03-03 20:17:26,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:17:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 54 proven. 54 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-03 20:17:26,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081203237] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:17:26,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:17:26,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 20:17:26,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219558265] [2025-03-03 20:17:26,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:17:26,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:17:26,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:17:26,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:17:26,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:17:26,910 INFO L87 Difference]: Start difference. First operand 380 states and 590 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-03 20:17:27,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:17:27,114 INFO L93 Difference]: Finished difference Result 584 states and 899 transitions. [2025-03-03 20:17:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:17:27,118 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 236 [2025-03-03 20:17:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:17:27,122 INFO L225 Difference]: With dead ends: 584 [2025-03-03 20:17:27,123 INFO L226 Difference]: Without dead ends: 281 [2025-03-03 20:17:27,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 469 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:17:27,127 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 74 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:17:27,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 247 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:17:27,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-03 20:17:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 275. [2025-03-03 20:17:27,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 157 states have (on average 1.2484076433121019) internal successors, (196), 157 states have internal predecessors, (196), 111 states have call successors, (111), 6 states have call predecessors, (111), 6 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-03 20:17:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 418 transitions. [2025-03-03 20:17:27,155 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 418 transitions. Word has length 236 [2025-03-03 20:17:27,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:17:27,155 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 418 transitions. [2025-03-03 20:17:27,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-03 20:17:27,156 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 418 transitions. [2025-03-03 20:17:27,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 20:17:27,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:17:27,157 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:27,165 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 20:17:27,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 20:17:27,358 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:17:27,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:17:27,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1616612652, now seen corresponding path program 1 times [2025-03-03 20:17:27,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:17:27,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539237154] [2025-03-03 20:17:27,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:27,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:17:27,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 20:17:27,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 20:17:27,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:27,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 51 proven. 159 refuted. 0 times theorem prover too weak. 2454 trivial. 0 not checked. [2025-03-03 20:17:27,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:17:27,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539237154] [2025-03-03 20:17:27,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539237154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:17:27,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589885844] [2025-03-03 20:17:27,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:27,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:17:27,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:17:27,958 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 20:17:27,960 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 20:17:28,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 20:17:28,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 20:17:28,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:28,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:28,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 20:17:28,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:17:28,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1199 proven. 159 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2025-03-03 20:17:28,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:17:29,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 51 proven. 162 refuted. 0 times theorem prover too weak. 2451 trivial. 0 not checked. [2025-03-03 20:17:29,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589885844] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:17:29,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:17:29,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-03-03 20:17:29,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771103996] [2025-03-03 20:17:29,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:17:29,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 20:17:29,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:17:29,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 20:17:29,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:17:29,350 INFO L87 Difference]: Start difference. First operand 275 states and 418 transitions. Second operand has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (68), 3 states have call predecessors, (68), 3 states have call successors, (68) [2025-03-03 20:17:30,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:17:30,465 INFO L93 Difference]: Finished difference Result 758 states and 1097 transitions. [2025-03-03 20:17:30,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-03 20:17:30,466 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (68), 3 states have call predecessors, (68), 3 states have call successors, (68) Word has length 236 [2025-03-03 20:17:30,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:17:30,471 INFO L225 Difference]: With dead ends: 758 [2025-03-03 20:17:30,471 INFO L226 Difference]: Without dead ends: 660 [2025-03-03 20:17:30,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 468 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 20:17:30,473 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 270 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:17:30,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 944 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:17:30,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-03-03 20:17:30,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 412. [2025-03-03 20:17:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 247 states have (on average 1.2348178137651822) internal successors, (305), 247 states have internal predecessors, (305), 148 states have call successors, (148), 16 states have call predecessors, (148), 16 states have return successors, (148), 148 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-03 20:17:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 601 transitions. [2025-03-03 20:17:30,528 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 601 transitions. Word has length 236 [2025-03-03 20:17:30,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:17:30,530 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 601 transitions. [2025-03-03 20:17:30,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 15 states have internal predecessors, (88), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (68), 3 states have call predecessors, (68), 3 states have call successors, (68) [2025-03-03 20:17:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 601 transitions. [2025-03-03 20:17:30,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 20:17:30,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:17:30,532 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:30,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 20:17:30,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:17:30,732 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:17:30,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:17:30,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1111054027, now seen corresponding path program 1 times [2025-03-03 20:17:30,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:17:30,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598488817] [2025-03-03 20:17:30,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:30,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:17:30,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 20:17:30,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 20:17:30,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:30,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:17:30,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [214135195] [2025-03-03 20:17:30,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:30,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:17:30,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:17:30,849 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:17:30,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 20:17:30,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 20:17:30,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 20:17:30,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:30,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:30,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 20:17:30,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:17:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 348 proven. 198 refuted. 0 times theorem prover too weak. 2118 trivial. 0 not checked. [2025-03-03 20:17:32,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:17:32,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:17:32,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598488817] [2025-03-03 20:17:32,808 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 20:17:32,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214135195] [2025-03-03 20:17:32,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214135195] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:17:32,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:17:32,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-03 20:17:32,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036384282] [2025-03-03 20:17:32,809 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 20:17:32,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 20:17:32,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:17:32,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 20:17:32,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2025-03-03 20:17:32,810 INFO L87 Difference]: Start difference. First operand 412 states and 601 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2025-03-03 20:17:33,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:17:33,576 INFO L93 Difference]: Finished difference Result 1110 states and 1565 transitions. [2025-03-03 20:17:33,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 20:17:33,576 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) Word has length 236 [2025-03-03 20:17:33,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:17:33,581 INFO L225 Difference]: With dead ends: 1110 [2025-03-03 20:17:33,581 INFO L226 Difference]: Without dead ends: 901 [2025-03-03 20:17:33,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=328, Invalid=794, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 20:17:33,583 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 159 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:17:33,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1183 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:17:33,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2025-03-03 20:17:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 804. [2025-03-03 20:17:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 502 states have (on average 1.2310756972111554) internal successors, (618), 504 states have internal predecessors, (618), 263 states have call successors, (263), 38 states have call predecessors, (263), 38 states have return successors, (263), 261 states have call predecessors, (263), 263 states have call successors, (263) [2025-03-03 20:17:33,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1144 transitions. [2025-03-03 20:17:33,663 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1144 transitions. Word has length 236 [2025-03-03 20:17:33,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:17:33,664 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1144 transitions. [2025-03-03 20:17:33,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2025-03-03 20:17:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1144 transitions. [2025-03-03 20:17:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 20:17:33,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:17:33,666 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:33,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 20:17:33,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:17:33,867 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:17:33,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:17:33,868 INFO L85 PathProgramCache]: Analyzing trace with hash 817651020, now seen corresponding path program 1 times [2025-03-03 20:17:33,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:17:33,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048914858] [2025-03-03 20:17:33,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:33,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:17:33,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 20:17:33,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 20:17:33,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:33,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:17:33,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [656922158] [2025-03-03 20:17:33,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:33,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:17:33,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:17:33,944 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:17:33,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 20:17:33,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 20:17:34,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 20:17:34,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:34,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:34,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 20:17:34,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:17:35,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 312 proven. 102 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2025-03-03 20:17:35,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:17:36,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:17:36,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048914858] [2025-03-03 20:17:36,153 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 20:17:36,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656922158] [2025-03-03 20:17:36,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656922158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:17:36,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:17:36,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-03 20:17:36,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143763932] [2025-03-03 20:17:36,153 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 20:17:36,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:17:36,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:17:36,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:17:36,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:17:36,154 INFO L87 Difference]: Start difference. First operand 804 states and 1144 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 20:17:36,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:17:36,954 INFO L93 Difference]: Finished difference Result 1489 states and 2114 transitions. [2025-03-03 20:17:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 20:17:36,955 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 236 [2025-03-03 20:17:36,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:17:36,963 INFO L225 Difference]: With dead ends: 1489 [2025-03-03 20:17:36,963 INFO L226 Difference]: Without dead ends: 1172 [2025-03-03 20:17:36,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-03 20:17:36,967 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 201 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:17:36,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 870 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:17:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2025-03-03 20:17:37,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1027. [2025-03-03 20:17:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 639 states have (on average 1.2253521126760563) internal successors, (783), 641 states have internal predecessors, (783), 337 states have call successors, (337), 50 states have call predecessors, (337), 50 states have return successors, (337), 335 states have call predecessors, (337), 337 states have call successors, (337) [2025-03-03 20:17:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1457 transitions. [2025-03-03 20:17:37,085 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1457 transitions. Word has length 236 [2025-03-03 20:17:37,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:17:37,085 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1457 transitions. [2025-03-03 20:17:37,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 20:17:37,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1457 transitions. [2025-03-03 20:17:37,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-03 20:17:37,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:17:37,088 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:37,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 20:17:37,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:17:37,288 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:17:37,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:17:37,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1772486471, now seen corresponding path program 1 times [2025-03-03 20:17:37,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:17:37,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426428264] [2025-03-03 20:17:37,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:37,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:17:37,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-03 20:17:37,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-03 20:17:37,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:37,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:17:37,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [667996818] [2025-03-03 20:17:37,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:37,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:17:37,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:17:37,389 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:17:37,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 20:17:37,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-03 20:17:37,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-03 20:17:37,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:37,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:17:37,508 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 20:17:37,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-03 20:17:37,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-03 20:17:37,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:37,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:17:37,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 20:17:37,724 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 20:17:37,724 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 20:17:37,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 20:17:37,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:17:37,930 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:17:38,067 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 20:17:38,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 08:17:38 BoogieIcfgContainer [2025-03-03 20:17:38,071 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 20:17:38,072 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 20:17:38,072 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 20:17:38,072 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 20:17:38,073 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:17:22" (3/4) ... [2025-03-03 20:17:38,074 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 20:17:38,075 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 20:17:38,075 INFO L158 Benchmark]: Toolchain (without parser) took 16243.58ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 121.7MB in the beginning and 116.9MB in the end (delta: 4.7MB). Peak memory consumption was 127.5MB. Max. memory is 16.1GB. [2025-03-03 20:17:38,076 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:17:38,076 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.20ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 105.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 20:17:38,076 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.23ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 101.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:17:38,076 INFO L158 Benchmark]: Boogie Preprocessor took 63.12ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 95.4MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:17:38,077 INFO L158 Benchmark]: IcfgBuilder took 587.77ms. Allocated memory is still 167.8MB. Free memory was 95.4MB in the beginning and 66.1MB in the end (delta: 29.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 20:17:38,077 INFO L158 Benchmark]: TraceAbstraction took 15306.88ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 65.7MB in the beginning and 117.0MB in the end (delta: -51.3MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2025-03-03 20:17:38,077 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 293.6MB. Free memory was 117.0MB in the beginning and 116.9MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:17:38,078 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.28ms. Allocated memory is still 201.3MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.20ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 105.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.23ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 101.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.12ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 95.4MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 587.77ms. Allocated memory is still 167.8MB. Free memory was 95.4MB in the beginning and 66.1MB in the end (delta: 29.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15306.88ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 65.7MB in the beginning and 117.0MB in the end (delta: -51.3MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 293.6MB. Free memory was 117.0MB in the beginning and 116.9MB in the end (delta: 92.3kB). 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 164, overapproximation of someBinaryFLOATComparisonOperation at line 189, overapproximation of someBinaryFLOATComparisonOperation at line 216, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 140, overapproximation of someBinaryFLOATComparisonOperation at line 187, overapproximation of someBinaryFLOATComparisonOperation at line 166, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someUnaryDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticFLOAToperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 1; [L39] signed short int var_1_24 = -32; [L40] unsigned char var_1_25 = 1; [L41] float var_1_26 = 500.65; [L42] signed long int var_1_27 = -8; [L43] float var_1_28 = 255.5; [L44] float var_1_29 = 7.5; [L45] float var_1_30 = 9.8; [L46] unsigned char var_1_31 = 4; [L47] signed long int var_1_32 = 1; [L48] unsigned char var_1_33 = 2; [L49] unsigned short int var_1_34 = 1; [L50] unsigned long int var_1_35 = 10; [L51] unsigned char var_1_36 = 10; [L52] unsigned char var_1_37 = 128; [L53] unsigned char var_1_38 = 16; [L54] unsigned char var_1_39 = 0; [L55] unsigned short int var_1_40 = 10; [L56] unsigned short int var_1_41 = 128; [L57] unsigned short int var_1_42 = 40597; [L58] signed short int last_1_var_1_1 = 16; [L59] unsigned char last_1_var_1_6 = 10; [L60] unsigned char last_1_var_1_8 = 1; [L61] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L220] isInitial = 1 [L221] FCALL initially() [L222] COND TRUE 1 [L223] CALL updateLastVariables() [L210] last_1_var_1_1 = var_1_1 [L211] last_1_var_1_6 = var_1_6 [L212] last_1_var_1_8 = var_1_8 [L213] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L223] RET updateLastVariables() [L224] CALL updateVariables() [L151] var_1_5 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L152] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L153] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L153] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1] [L154] var_1_7 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L155] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L156] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L156] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L157] var_1_11 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L158] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L159] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L159] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L160] var_1_12 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L161] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L162] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L162] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L163] var_1_15 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L164] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L165] var_1_16 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L166] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L167] var_1_20 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L168] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L169] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L169] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L170] var_1_22 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L171] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L172] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L173] var_1_23 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L174] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L175] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L175] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L176] var_1_24 = __VERIFIER_nondet_short() [L177] CALL assume_abort_if_not(var_1_24 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L177] RET assume_abort_if_not(var_1_24 >= -32768) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L178] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L178] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L179] var_1_25 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L180] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L181] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L181] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L182] var_1_27 = __VERIFIER_nondet_long() [L183] CALL assume_abort_if_not(var_1_27 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L183] RET assume_abort_if_not(var_1_27 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L184] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L184] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L185] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L185] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L186] var_1_28 = __VERIFIER_nondet_float() [L187] CALL assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L187] RET assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L188] var_1_29 = __VERIFIER_nondet_float() [L189] CALL assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L189] RET assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=1, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L190] var_1_32 = __VERIFIER_nondet_long() [L191] CALL assume_abort_if_not(var_1_32 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L191] RET assume_abort_if_not(var_1_32 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L192] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L192] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L193] var_1_33 = __VERIFIER_nondet_uchar() [L194] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L194] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L195] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L195] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L196] var_1_37 = __VERIFIER_nondet_uchar() [L197] CALL assume_abort_if_not(var_1_37 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L197] RET assume_abort_if_not(var_1_37 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L198] CALL assume_abort_if_not(var_1_37 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L198] RET assume_abort_if_not(var_1_37 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L199] var_1_38 = __VERIFIER_nondet_uchar() [L200] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L200] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L201] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L201] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L202] var_1_39 = __VERIFIER_nondet_uchar() [L203] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L203] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L204] CALL assume_abort_if_not(var_1_39 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L204] RET assume_abort_if_not(var_1_39 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L205] var_1_42 = __VERIFIER_nondet_ushort() [L206] CALL assume_abort_if_not(var_1_42 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L206] RET assume_abort_if_not(var_1_42 >= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L207] CALL assume_abort_if_not(var_1_42 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L207] RET assume_abort_if_not(var_1_42 <= 65534) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L224] RET updateVariables() [L225] CALL step() [L65] COND TRUE var_1_22 || var_1_23 [L66] var_1_21 = ((var_1_24 > -4) || var_1_25) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_26=10013/20, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L68] COND TRUE ((var_1_24 + 25) % var_1_27) < 2 [L69] var_1_26 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) + var_1_29) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_30=49/5, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L71] COND TRUE (- var_1_28) < ((((var_1_26) > (var_1_29)) ? (var_1_26) : (var_1_29))) [L72] var_1_30 = var_1_29 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=4, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L74] COND TRUE ((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) < (var_1_24)) ? (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) : (var_1_24))) <= var_1_32 [L75] var_1_31 = var_1_33 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L77] COND TRUE var_1_31 < ((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) [L78] var_1_34 = ((((((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) > (var_1_33)) ? (((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) : (var_1_33))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L80] COND TRUE \read(var_1_25) [L81] var_1_35 = var_1_33 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=10, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L83] COND TRUE \read(var_1_25) [L84] var_1_36 = (var_1_37 - var_1_38) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L88] COND TRUE (- var_1_36) != var_1_34 [L89] var_1_40 = var_1_39 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=128, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L91] COND FALSE !(var_1_33 <= (~ var_1_34)) [L96] var_1_41 = var_1_36 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L98] signed long int stepLocal_6 = last_1_var_1_1; [L99] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L100] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L101] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L104] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L109] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=127, var_1_6=10, var_1_7=-2, var_1_8=1] [L112] COND TRUE var_1_5 >= -2 [L113] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L115] unsigned char stepLocal_4 = var_1_6; [L116] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L117] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=154, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L118] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L119] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L126] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L127] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L130] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L131] COND TRUE \read(var_1_19) [L132] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L138] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L139] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-2, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=1] [L140] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L147] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=154, stepLocal_1=-2, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] [L225] RET step() [L226] CALL, EXPR property() [L216-L217] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] [L226] RET, EXPR property() [L226] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=254, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=154, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=255, var_1_25=1, var_1_27=279, var_1_29=2, var_1_30=2, var_1_31=254, var_1_32=255, var_1_33=254, var_1_34=254, var_1_35=254, var_1_36=0, var_1_37=127, var_1_38=-129, var_1_39=0, var_1_40=0, var_1_41=0, var_1_42=32767, var_1_5=127, var_1_6=154, var_1_7=-2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 10, TraceHistogramMax: 37, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1096 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1039 mSDsluCounter, 5034 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3610 mSDsCounter, 542 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2735 IncrementalHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 542 mSolverCounterUnsat, 1424 mSDtfsCounter, 2735 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2180 GetRequests, 2057 SyntacticMatches, 3 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1027occurred in iteration=9, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 627 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 3774 NumberOfCodeBlocks, 3774 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3286 ConstructedInterpolants, 1 QuantifiedInterpolants, 14290 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2712 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 36282/37296 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 20:17:38,114 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_fillercode_fillercodesize_ps-cn-50_file-42.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 c43b6c6bf1e929a2c5ffb78cc7ba63d9bb07f6da61e5bcfce9d1a73030d3f75b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:17:40,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:17:40,080 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 20:17:40,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:17:40,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:17:40,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:17:40,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:17:40,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:17:40,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:17:40,103 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:17:40,104 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:17:40,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:17:40,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:17:40,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:17:40,104 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:17:40,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:17:40,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:17:40,105 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:17:40,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:17:40,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:17:40,105 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:17:40,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:17:40,105 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:17:40,105 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 20:17:40,105 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 20:17:40,105 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 20:17:40,106 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:17:40,106 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:17:40,106 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:17:40,106 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:17:40,106 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:17:40,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:17:40,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:17:40,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:17:40,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:17:40,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:17:40,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:17:40,107 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:17:40,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:17:40,107 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 20:17:40,107 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 20:17:40,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:17:40,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:17:40,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:17:40,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:17:40,108 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 -> c43b6c6bf1e929a2c5ffb78cc7ba63d9bb07f6da61e5bcfce9d1a73030d3f75b [2025-03-03 20:17:40,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:17:40,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:17:40,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:17:40,339 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:17:40,339 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:17:40,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-42.i [2025-03-03 20:17:41,542 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fed4f2f0/3d3bc014655042ef81ec0774d68e11c4/FLAG3da8135f8 [2025-03-03 20:17:41,783 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:17:41,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-42.i [2025-03-03 20:17:41,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fed4f2f0/3d3bc014655042ef81ec0774d68e11c4/FLAG3da8135f8 [2025-03-03 20:17:42,110 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fed4f2f0/3d3bc014655042ef81ec0774d68e11c4 [2025-03-03 20:17:42,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:17:42,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:17:42,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:17:42,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:17:42,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:17:42,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:17:42" (1/1) ... [2025-03-03 20:17:42,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fadf25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:42, skipping insertion in model container [2025-03-03 20:17:42,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:17:42" (1/1) ... [2025-03-03 20:17:42,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:17:42,255 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_fillercode_fillercodesize_ps-cn-50_file-42.i[915,928] [2025-03-03 20:17:42,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:17:42,328 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:17:42,337 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_fillercode_fillercodesize_ps-cn-50_file-42.i[915,928] [2025-03-03 20:17:42,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:17:42,379 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:17:42,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:42 WrapperNode [2025-03-03 20:17:42,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:17:42,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:17:42,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:17:42,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:17:42,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:42" (1/1) ... [2025-03-03 20:17:42,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:42" (1/1) ... [2025-03-03 20:17:42,419 INFO L138 Inliner]: procedures = 27, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2025-03-03 20:17:42,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:17:42,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:17:42,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:17:42,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:17:42,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:42" (1/1) ... [2025-03-03 20:17:42,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:42" (1/1) ... [2025-03-03 20:17:42,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:42" (1/1) ... [2025-03-03 20:17:42,443 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 20:17:42,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:42" (1/1) ... [2025-03-03 20:17:42,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:42" (1/1) ... [2025-03-03 20:17:42,450 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:42" (1/1) ... [2025-03-03 20:17:42,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:42" (1/1) ... [2025-03-03 20:17:42,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:42" (1/1) ... [2025-03-03 20:17:42,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:42" (1/1) ... [2025-03-03 20:17:42,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:17:42,460 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:17:42,460 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:17:42,460 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:17:42,461 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:42" (1/1) ... [2025-03-03 20:17:42,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:17:42,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:17:42,492 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 20:17:42,495 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 20:17:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:17:42,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 20:17:42,515 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:17:42,515 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:17:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:17:42,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:17:42,595 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:17:42,596 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:17:43,281 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 20:17:43,281 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:17:43,291 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:17:43,291 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:17:43,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:17:43 BoogieIcfgContainer [2025-03-03 20:17:43,291 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:17:43,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:17:43,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:17:43,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:17:43,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:17:42" (1/3) ... [2025-03-03 20:17:43,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7231c6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:17:43, skipping insertion in model container [2025-03-03 20:17:43,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:17:42" (2/3) ... [2025-03-03 20:17:43,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7231c6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:17:43, skipping insertion in model container [2025-03-03 20:17:43,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:17:43" (3/3) ... [2025-03-03 20:17:43,300 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-42.i [2025-03-03 20:17:43,311 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:17:43,314 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-42.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:17:43,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:17:43,361 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;@52c82920, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:17:43,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:17:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 20:17:43,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 20:17:43,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:17:43,375 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:43,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:17:43,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:17:43,379 INFO L85 PathProgramCache]: Analyzing trace with hash -376507049, now seen corresponding path program 1 times [2025-03-03 20:17:43,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:17:43,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024555919] [2025-03-03 20:17:43,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:43,391 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 20:17:43,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:17:43,393 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 20:17:43,394 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 20:17:43,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 20:17:43,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 20:17:43,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:43,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:43,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:17:43,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:17:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 884 proven. 0 refuted. 0 times theorem prover too weak. 1780 trivial. 0 not checked. [2025-03-03 20:17:43,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:17:43,802 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:17:43,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024555919] [2025-03-03 20:17:43,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024555919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:17:43,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:17:43,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:17:43,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557494446] [2025-03-03 20:17:43,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:17:43,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:17:43,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:17:43,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:17:43,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:17:43,830 INFO L87 Difference]: Start difference. First operand has 101 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 20:17:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:17:43,861 INFO L93 Difference]: Finished difference Result 195 states and 350 transitions. [2025-03-03 20:17:43,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:17:43,862 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 235 [2025-03-03 20:17:43,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:17:43,866 INFO L225 Difference]: With dead ends: 195 [2025-03-03 20:17:43,866 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 20:17:43,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 234 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 20:17:43,871 INFO L435 NwaCegarLoop]: 152 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, 152 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 20:17:43,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:17:43,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 20:17:43,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-03 20:17:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 20:17:43,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 152 transitions. [2025-03-03 20:17:43,910 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 152 transitions. Word has length 235 [2025-03-03 20:17:43,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:17:43,910 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 152 transitions. [2025-03-03 20:17:43,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 20:17:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 152 transitions. [2025-03-03 20:17:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 20:17:43,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:17:43,915 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:43,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 20:17:44,116 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 20:17:44,116 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:17:44,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:17:44,117 INFO L85 PathProgramCache]: Analyzing trace with hash -266057512, now seen corresponding path program 1 times [2025-03-03 20:17:44,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:17:44,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384348541] [2025-03-03 20:17:44,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:44,118 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 20:17:44,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:17:44,120 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 20:17:44,121 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 20:17:44,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 20:17:44,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 20:17:44,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:44,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:44,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 20:17:44,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:17:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1368 proven. 54 refuted. 0 times theorem prover too weak. 1242 trivial. 0 not checked. [2025-03-03 20:17:44,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:17:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 54 proven. 54 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2025-03-03 20:17:44,956 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:17:44,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384348541] [2025-03-03 20:17:44,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384348541] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:17:44,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 20:17:44,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 20:17:44,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495159039] [2025-03-03 20:17:44,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 20:17:44,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:17:44,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:17:44,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:17:44,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:17:44,961 INFO L87 Difference]: Start difference. First operand 97 states and 152 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-03 20:17:45,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:17:45,298 INFO L93 Difference]: Finished difference Result 197 states and 306 transitions. [2025-03-03 20:17:45,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:17:45,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 235 [2025-03-03 20:17:45,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:17:45,301 INFO L225 Difference]: With dead ends: 197 [2025-03-03 20:17:45,301 INFO L226 Difference]: Without dead ends: 103 [2025-03-03 20:17:45,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 462 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:17:45,302 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 75 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:17:45,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 251 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:17:45,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-03 20:17:45,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2025-03-03 20:17:45,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 61 states have internal predecessors, (79), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 20:17:45,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 153 transitions. [2025-03-03 20:17:45,326 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 153 transitions. Word has length 235 [2025-03-03 20:17:45,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:17:45,330 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 153 transitions. [2025-03-03 20:17:45,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2025-03-03 20:17:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 153 transitions. [2025-03-03 20:17:45,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 20:17:45,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:17:45,332 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:45,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 20:17:45,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:17:45,533 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:17:45,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:17:45,534 INFO L85 PathProgramCache]: Analyzing trace with hash 142766713, now seen corresponding path program 1 times [2025-03-03 20:17:45,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:17:45,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005669755] [2025-03-03 20:17:45,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:45,534 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 20:17:45,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:17:45,537 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:17:45,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 20:17:45,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 20:17:45,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 20:17:45,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:45,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:45,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 20:17:45,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:17:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-03 20:17:46,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:17:46,128 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:17:46,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005669755] [2025-03-03 20:17:46,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005669755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:17:46,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:17:46,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:17:46,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809091069] [2025-03-03 20:17:46,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:17:46,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:17:46,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:17:46,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:17:46,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:17:46,130 INFO L87 Difference]: Start difference. First operand 101 states and 153 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 20:17:46,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:17:46,462 INFO L93 Difference]: Finished difference Result 298 states and 454 transitions. [2025-03-03 20:17:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:17:46,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 235 [2025-03-03 20:17:46,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:17:46,468 INFO L225 Difference]: With dead ends: 298 [2025-03-03 20:17:46,468 INFO L226 Difference]: Without dead ends: 200 [2025-03-03 20:17:46,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:17:46,470 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 102 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:17:46,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 432 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:17:46,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-03 20:17:46,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 179. [2025-03-03 20:17:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 100 states have (on average 1.24) internal successors, (124), 100 states have internal predecessors, (124), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 20:17:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 272 transitions. [2025-03-03 20:17:46,498 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 272 transitions. Word has length 235 [2025-03-03 20:17:46,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:17:46,499 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 272 transitions. [2025-03-03 20:17:46,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 20:17:46,499 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 272 transitions. [2025-03-03 20:17:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 20:17:46,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:17:46,503 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:46,514 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 (4)] Forceful destruction successful, exit code 0 [2025-03-03 20:17:46,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:17:46,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:17:46,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:17:46,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1916515306, now seen corresponding path program 1 times [2025-03-03 20:17:46,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:17:46,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142563704] [2025-03-03 20:17:46,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:46,705 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 20:17:46,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:17:46,708 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:17:46,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 20:17:46,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 20:17:46,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 20:17:46,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:46,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:46,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:17:46,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:17:47,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-03 20:17:47,736 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:17:47,737 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:17:47,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142563704] [2025-03-03 20:17:47,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142563704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:17:47,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:17:47,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:17:47,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426885810] [2025-03-03 20:17:47,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:17:47,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:17:47,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:17:47,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:17:47,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:17:47,738 INFO L87 Difference]: Start difference. First operand 179 states and 272 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 20:17:48,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:17:48,324 INFO L93 Difference]: Finished difference Result 419 states and 639 transitions. [2025-03-03 20:17:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:17:48,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 236 [2025-03-03 20:17:48,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:17:48,332 INFO L225 Difference]: With dead ends: 419 [2025-03-03 20:17:48,332 INFO L226 Difference]: Without dead ends: 321 [2025-03-03 20:17:48,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:17:48,333 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 132 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:17:48,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 559 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:17:48,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-03 20:17:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 275. [2025-03-03 20:17:48,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 157 states have (on average 1.2611464968152866) internal successors, (198), 157 states have internal predecessors, (198), 111 states have call successors, (111), 6 states have call predecessors, (111), 6 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-03 20:17:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 420 transitions. [2025-03-03 20:17:48,365 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 420 transitions. Word has length 236 [2025-03-03 20:17:48,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:17:48,365 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 420 transitions. [2025-03-03 20:17:48,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 20:17:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 420 transitions. [2025-03-03 20:17:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 20:17:48,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:17:48,367 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:48,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-03 20:17:48,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:17:48,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:17:48,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:17:48,569 INFO L85 PathProgramCache]: Analyzing trace with hash -870900181, now seen corresponding path program 1 times [2025-03-03 20:17:48,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:17:48,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101805577] [2025-03-03 20:17:48,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:48,570 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 20:17:48,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:17:48,571 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:17:48,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-03 20:17:48,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 20:17:48,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 20:17:48,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:48,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:48,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 20:17:48,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:17:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-03 20:17:48,840 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:17:48,840 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:17:48,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101805577] [2025-03-03 20:17:48,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101805577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:17:48,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:17:48,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:17:48,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135766475] [2025-03-03 20:17:48,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:17:48,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:17:48,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:17:48,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:17:48,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:17:48,842 INFO L87 Difference]: Start difference. First operand 275 states and 420 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 20:17:48,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:17:48,972 INFO L93 Difference]: Finished difference Result 469 states and 718 transitions. [2025-03-03 20:17:48,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:17:48,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 236 [2025-03-03 20:17:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:17:48,983 INFO L225 Difference]: With dead ends: 469 [2025-03-03 20:17:48,983 INFO L226 Difference]: Without dead ends: 275 [2025-03-03 20:17:48,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:17:48,987 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:17:48,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:17:48,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-03 20:17:49,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-03-03 20:17:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 157 states have (on average 1.2484076433121019) internal successors, (196), 157 states have internal predecessors, (196), 111 states have call successors, (111), 6 states have call predecessors, (111), 6 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-03 20:17:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 418 transitions. [2025-03-03 20:17:49,015 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 418 transitions. Word has length 236 [2025-03-03 20:17:49,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:17:49,016 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 418 transitions. [2025-03-03 20:17:49,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 20:17:49,017 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 418 transitions. [2025-03-03 20:17:49,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 20:17:49,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:17:49,019 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:49,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-03 20:17:49,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 20:17:49,220 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:17:49,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:17:49,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1616612652, now seen corresponding path program 1 times [2025-03-03 20:17:49,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:17:49,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394519187] [2025-03-03 20:17:49,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:49,221 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 20:17:49,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:17:49,224 INFO L229 MonitoredProcess]: Starting monitored process 7 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 20:17:49,225 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 (7)] Waiting until timeout for monitored process [2025-03-03 20:17:49,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 20:17:49,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 20:17:49,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:49,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:49,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 20:17:49,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:17:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1199 proven. 159 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2025-03-03 20:17:49,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:17:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 51 proven. 162 refuted. 0 times theorem prover too weak. 2451 trivial. 0 not checked. [2025-03-03 20:17:50,340 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:17:50,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394519187] [2025-03-03 20:17:50,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394519187] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:17:50,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 20:17:50,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-03-03 20:17:50,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780557128] [2025-03-03 20:17:50,340 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 20:17:50,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 20:17:50,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:17:50,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 20:17:50,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:17:50,342 INFO L87 Difference]: Start difference. First operand 275 states and 418 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2025-03-03 20:17:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:17:51,558 INFO L93 Difference]: Finished difference Result 536 states and 777 transitions. [2025-03-03 20:17:51,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 20:17:51,558 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) Word has length 236 [2025-03-03 20:17:51,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:17:51,563 INFO L225 Difference]: With dead ends: 536 [2025-03-03 20:17:51,564 INFO L226 Difference]: Without dead ends: 438 [2025-03-03 20:17:51,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 460 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 20:17:51,565 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 399 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:17:51,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 765 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:17:51,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-03 20:17:51,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 412. [2025-03-03 20:17:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 247 states have (on average 1.2348178137651822) internal successors, (305), 247 states have internal predecessors, (305), 148 states have call successors, (148), 16 states have call predecessors, (148), 16 states have return successors, (148), 148 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-03 20:17:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 601 transitions. [2025-03-03 20:17:51,613 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 601 transitions. Word has length 236 [2025-03-03 20:17:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:17:51,614 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 601 transitions. [2025-03-03 20:17:51,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2025-03-03 20:17:51,614 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 601 transitions. [2025-03-03 20:17:51,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 20:17:51,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:17:51,616 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:51,628 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 (7)] Forceful destruction successful, exit code 0 [2025-03-03 20:17:51,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 20:17:51,820 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:17:51,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:17:51,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1111054027, now seen corresponding path program 1 times [2025-03-03 20:17:51,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:17:51,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136459534] [2025-03-03 20:17:51,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:51,821 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 20:17:51,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:17:51,824 INFO L229 MonitoredProcess]: Starting monitored process 8 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 20:17:51,824 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 (8)] Waiting until timeout for monitored process [2025-03-03 20:17:51,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 20:17:52,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 20:17:52,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:52,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:52,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 20:17:52,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:17:52,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 312 proven. 102 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2025-03-03 20:17:52,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:17:53,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:17:53,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136459534] [2025-03-03 20:17:53,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136459534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:17:53,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1284933736] [2025-03-03 20:17:53,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:53,377 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 20:17:53,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 20:17:53,389 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 20:17:53,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-03 20:17:53,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 20:17:54,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 20:17:54,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:54,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:54,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 20:17:54,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:17:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-03 20:17:54,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:17:54,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1284933736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:17:54,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:17:54,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-03 20:17:54,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444939664] [2025-03-03 20:17:54,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:17:54,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:17:54,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:17:54,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:17:54,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:17:54,502 INFO L87 Difference]: Start difference. First operand 412 states and 601 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 20:17:56,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:17:56,378 INFO L93 Difference]: Finished difference Result 1054 states and 1517 transitions. [2025-03-03 20:17:56,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:17:56,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 236 [2025-03-03 20:17:56,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:17:56,389 INFO L225 Difference]: With dead ends: 1054 [2025-03-03 20:17:56,389 INFO L226 Difference]: Without dead ends: 845 [2025-03-03 20:17:56,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:17:56,390 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 153 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:17:56,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 627 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 20:17:56,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-03-03 20:17:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 772. [2025-03-03 20:17:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 478 states have (on average 1.2426778242677825) internal successors, (594), 480 states have internal predecessors, (594), 263 states have call successors, (263), 30 states have call predecessors, (263), 30 states have return successors, (263), 261 states have call predecessors, (263), 263 states have call successors, (263) [2025-03-03 20:17:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1120 transitions. [2025-03-03 20:17:56,456 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1120 transitions. Word has length 236 [2025-03-03 20:17:56,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:17:56,457 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1120 transitions. [2025-03-03 20:17:56,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 20:17:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1120 transitions. [2025-03-03 20:17:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 20:17:56,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:17:56,458 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:17:56,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-03-03 20:17:56,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-03 20:17:56,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /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 20:17:56,859 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:17:56,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:17:56,859 INFO L85 PathProgramCache]: Analyzing trace with hash 817651020, now seen corresponding path program 1 times [2025-03-03 20:17:56,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:17:56,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291632119] [2025-03-03 20:17:56,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:56,860 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 20:17:56,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:17:56,862 INFO L229 MonitoredProcess]: Starting monitored process 10 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 20:17:56,862 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 (10)] Waiting until timeout for monitored process [2025-03-03 20:17:56,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 20:17:57,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 20:17:57,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:57,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:57,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 20:17:57,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:17:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 312 proven. 102 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2025-03-03 20:17:57,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:17:58,233 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:17:58,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291632119] [2025-03-03 20:17:58,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291632119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:17:58,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [798998792] [2025-03-03 20:17:58,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:17:58,234 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 20:17:58,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 20:17:58,235 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 20:17:58,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2025-03-03 20:17:58,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 20:17:58,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 20:17:58,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:17:58,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:17:58,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 20:17:58,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:17:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2025-03-03 20:17:59,727 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:17:59,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [798998792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:17:59,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:17:59,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-03 20:17:59,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412107589] [2025-03-03 20:17:59,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:17:59,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:17:59,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:17:59,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:17:59,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:17:59,728 INFO L87 Difference]: Start difference. First operand 772 states and 1120 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 20:18:01,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:18:01,538 INFO L93 Difference]: Finished difference Result 1338 states and 1940 transitions. [2025-03-03 20:18:01,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:18:01,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 236 [2025-03-03 20:18:01,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:18:01,545 INFO L225 Difference]: With dead ends: 1338 [2025-03-03 20:18:01,545 INFO L226 Difference]: Without dead ends: 1021 [2025-03-03 20:18:01,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:18:01,548 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 101 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:18:01,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 544 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 20:18:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-03-03 20:18:01,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 979. [2025-03-03 20:18:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 603 states have (on average 1.2388059701492538) internal successors, (747), 605 states have internal predecessors, (747), 337 states have call successors, (337), 38 states have call predecessors, (337), 38 states have return successors, (337), 335 states have call predecessors, (337), 337 states have call successors, (337) [2025-03-03 20:18:01,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1421 transitions. [2025-03-03 20:18:01,634 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1421 transitions. Word has length 236 [2025-03-03 20:18:01,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:18:01,635 INFO L471 AbstractCegarLoop]: Abstraction has 979 states and 1421 transitions. [2025-03-03 20:18:01,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2025-03-03 20:18:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1421 transitions. [2025-03-03 20:18:01,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-03 20:18:01,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:18:01,638 INFO L218 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:18:01,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2025-03-03 20:18:01,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-03 20:18:02,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /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 20:18:02,039 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:18:02,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:18:02,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1772486471, now seen corresponding path program 1 times [2025-03-03 20:18:02,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:18:02,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136867697] [2025-03-03 20:18:02,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:18:02,040 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 20:18:02,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:18:02,041 INFO L229 MonitoredProcess]: Starting monitored process 12 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 20:18:02,042 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 (12)] Waiting until timeout for monitored process [2025-03-03 20:18:02,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-03 20:18:02,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-03 20:18:02,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:18:02,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:18:02,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 20:18:02,299 INFO L279 TraceCheckSpWp]: Computing forward predicates...