./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-29.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-10_file-29.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 b3da19090aa76dca033c6d25fa7336bc4f04f864a604dbf4ea33dc233ad87a23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:34:06,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:34:06,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:34:06,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:34:06,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:34:06,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:34:06,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:34:06,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:34:06,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:34:06,841 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:34:06,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:34:06,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:34:06,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:34:06,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:34:06,841 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:34:06,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:34:06,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:34:06,842 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:34:06,842 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:34:06,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:34:06,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:34:06,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:34:06,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:34:06,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:34:06,842 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:34:06,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:34:06,842 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:34:06,842 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:34:06,842 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:34:06,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:34:06,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:34:06,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:34:06,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:34:06,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:34:06,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:34:06,843 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:34:06,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:34:06,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:34:06,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:34:06,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:34:06,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:34:06,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:34:06,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:34:06,843 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 -> b3da19090aa76dca033c6d25fa7336bc4f04f864a604dbf4ea33dc233ad87a23 [2025-03-03 19:34:07,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:34:07,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:34:07,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:34:07,086 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:34:07,086 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:34:07,087 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-10_file-29.i [2025-03-03 19:34:08,280 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a7edf48/6974262d97d54fdca79b1dab6f2de4cb/FLAG49c117bd3 [2025-03-03 19:34:08,530 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:34:08,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-29.i [2025-03-03 19:34:08,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a7edf48/6974262d97d54fdca79b1dab6f2de4cb/FLAG49c117bd3 [2025-03-03 19:34:08,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a7edf48/6974262d97d54fdca79b1dab6f2de4cb [2025-03-03 19:34:08,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:34:08,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:34:08,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:34:08,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:34:08,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:34:08,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:34:08" (1/1) ... [2025-03-03 19:34:08,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b845e56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:08, skipping insertion in model container [2025-03-03 19:34:08,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:34:08" (1/1) ... [2025-03-03 19:34:08,582 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:34:08,698 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-10_file-29.i[915,928] [2025-03-03 19:34:08,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:34:08,759 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:34:08,766 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-10_file-29.i[915,928] [2025-03-03 19:34:08,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:34:08,804 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:34:08,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:08 WrapperNode [2025-03-03 19:34:08,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:34:08,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:34:08,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:34:08,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:34:08,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:08" (1/1) ... [2025-03-03 19:34:08,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:08" (1/1) ... [2025-03-03 19:34:08,832 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2025-03-03 19:34:08,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:34:08,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:34:08,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:34:08,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:34:08,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:08" (1/1) ... [2025-03-03 19:34:08,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:08" (1/1) ... [2025-03-03 19:34:08,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:08" (1/1) ... [2025-03-03 19:34:08,852 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 19:34:08,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:08" (1/1) ... [2025-03-03 19:34:08,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:08" (1/1) ... [2025-03-03 19:34:08,857 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:08" (1/1) ... [2025-03-03 19:34:08,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:08" (1/1) ... [2025-03-03 19:34:08,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:08" (1/1) ... [2025-03-03 19:34:08,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:08" (1/1) ... [2025-03-03 19:34:08,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:34:08,866 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:34:08,866 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:34:08,867 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:34:08,867 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:08" (1/1) ... [2025-03-03 19:34:08,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:34:08,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:34:08,894 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 19:34:08,897 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 19:34:08,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:34:08,914 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:34:08,914 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:34:08,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:34:08,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:34:08,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:34:08,980 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:34:08,981 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:34:09,230 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 19:34:09,232 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:34:09,239 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:34:09,240 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:34:09,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:34:09 BoogieIcfgContainer [2025-03-03 19:34:09,240 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:34:09,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:34:09,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:34:09,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:34:09,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:34:08" (1/3) ... [2025-03-03 19:34:09,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e0dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:34:09, skipping insertion in model container [2025-03-03 19:34:09,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:08" (2/3) ... [2025-03-03 19:34:09,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e0dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:34:09, skipping insertion in model container [2025-03-03 19:34:09,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:34:09" (3/3) ... [2025-03-03 19:34:09,249 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-29.i [2025-03-03 19:34:09,259 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:34:09,262 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-29.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:34:09,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:34:09,321 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;@24609450, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:34:09,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:34:09,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 50 states have internal predecessors, (65), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 19:34:09,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-03 19:34:09,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:09,336 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:34:09,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:09,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:09,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1743909020, now seen corresponding path program 1 times [2025-03-03 19:34:09,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:34:09,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107554120] [2025-03-03 19:34:09,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:09,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:34:09,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 19:34:09,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 19:34:09,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:09,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:09,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2025-03-03 19:34:09,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:34:09,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107554120] [2025-03-03 19:34:09,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107554120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:34:09,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254061444] [2025-03-03 19:34:09,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:09,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:34:09,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:34:09,677 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 19:34:09,679 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 19:34:09,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 19:34:09,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 19:34:09,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:09,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:09,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:34:09,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2025-03-03 19:34:09,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:34:09,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254061444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:09,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:34:09,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:34:09,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147064096] [2025-03-03 19:34:09,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:09,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:34:09,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:34:09,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:34:09,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:34:09,922 INFO L87 Difference]: Start difference. First operand has 91 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 50 states have internal predecessors, (65), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-03 19:34:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:09,947 INFO L93 Difference]: Finished difference Result 176 states and 320 transitions. [2025-03-03 19:34:09,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:34:09,949 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) Word has length 233 [2025-03-03 19:34:09,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:09,954 INFO L225 Difference]: With dead ends: 176 [2025-03-03 19:34:09,954 INFO L226 Difference]: Without dead ends: 88 [2025-03-03 19:34:09,956 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 19:34:09,958 INFO L435 NwaCegarLoop]: 138 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, 138 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 19:34:09,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:34:09,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-03 19:34:09,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-03 19:34:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 19:34:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2025-03-03 19:34:09,995 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 233 [2025-03-03 19:34:09,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:09,996 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2025-03-03 19:34:09,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-03 19:34:09,996 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2025-03-03 19:34:10,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-03 19:34:10,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:10,003 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:34:10,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 19:34:10,207 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 19:34:10,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:10,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:10,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1586470311, now seen corresponding path program 1 times [2025-03-03 19:34:10,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:34:10,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718141358] [2025-03-03 19:34:10,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:10,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:34:10,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 19:34:10,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 19:34:10,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:10,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-03 19:34:10,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:34:10,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718141358] [2025-03-03 19:34:10,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718141358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:10,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:34:10,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:34:10,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182932654] [2025-03-03 19:34:10,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:10,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:34:10,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:34:10,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:34:10,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:34:10,677 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-03 19:34:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:10,725 INFO L93 Difference]: Finished difference Result 258 states and 408 transitions. [2025-03-03 19:34:10,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:34:10,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 233 [2025-03-03 19:34:10,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:10,728 INFO L225 Difference]: With dead ends: 258 [2025-03-03 19:34:10,728 INFO L226 Difference]: Without dead ends: 173 [2025-03-03 19:34:10,729 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 19:34:10,730 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 65 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:10,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 267 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:34:10,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-03 19:34:10,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2025-03-03 19:34:10,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 90 states have internal predecessors, (115), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 19:34:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 271 transitions. [2025-03-03 19:34:10,781 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 271 transitions. Word has length 233 [2025-03-03 19:34:10,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:10,782 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 271 transitions. [2025-03-03 19:34:10,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-03 19:34:10,782 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 271 transitions. [2025-03-03 19:34:10,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-03 19:34:10,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:10,786 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:34:10,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:34:10,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:10,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:10,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1615099462, now seen corresponding path program 1 times [2025-03-03 19:34:10,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:34:10,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893314130] [2025-03-03 19:34:10,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:10,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:34:10,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 19:34:10,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 19:34:10,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:10,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:11,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 69 proven. 45 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2025-03-03 19:34:11,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:34:11,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893314130] [2025-03-03 19:34:11,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893314130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:34:11,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14159470] [2025-03-03 19:34:11,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:11,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:34:11,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:34:11,177 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 19:34:11,179 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 19:34:11,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 19:34:11,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 19:34:11,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:11,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:11,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 19:34:11,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:11,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1952 proven. 45 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [2025-03-03 19:34:11,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:34:12,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 69 proven. 45 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2025-03-03 19:34:12,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14159470] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:34:12,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:34:12,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-03 19:34:12,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735406813] [2025-03-03 19:34:12,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:34:12,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 19:34:12,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:34:12,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 19:34:12,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-03 19:34:12,050 INFO L87 Difference]: Start difference. First operand 171 states and 271 transitions. Second operand has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 6 states have call successors, (101), 3 states have call predecessors, (101), 6 states have return successors, (101), 6 states have call predecessors, (101), 6 states have call successors, (101) [2025-03-03 19:34:12,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:12,364 INFO L93 Difference]: Finished difference Result 351 states and 549 transitions. [2025-03-03 19:34:12,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:34:12,365 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 6 states have call successors, (101), 3 states have call predecessors, (101), 6 states have return successors, (101), 6 states have call predecessors, (101), 6 states have call successors, (101) Word has length 233 [2025-03-03 19:34:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:12,367 INFO L225 Difference]: With dead ends: 351 [2025-03-03 19:34:12,367 INFO L226 Difference]: Without dead ends: 183 [2025-03-03 19:34:12,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:34:12,369 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 224 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:12,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 188 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:34:12,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-03 19:34:12,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2025-03-03 19:34:12,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 96 states have internal predecessors, (119), 78 states have call successors, (78), 4 states have call predecessors, (78), 4 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 19:34:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 275 transitions. [2025-03-03 19:34:12,403 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 275 transitions. Word has length 233 [2025-03-03 19:34:12,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:12,404 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 275 transitions. [2025-03-03 19:34:12,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 6 states have call successors, (101), 3 states have call predecessors, (101), 6 states have return successors, (101), 6 states have call predecessors, (101), 6 states have call successors, (101) [2025-03-03 19:34:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 275 transitions. [2025-03-03 19:34:12,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-03 19:34:12,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:12,407 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:34:12,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 19:34:12,607 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,SelfDestructingSolverStorable2 [2025-03-03 19:34:12,608 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:12,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:12,609 INFO L85 PathProgramCache]: Analyzing trace with hash 39020117, now seen corresponding path program 1 times [2025-03-03 19:34:12,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:34:12,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971728672] [2025-03-03 19:34:12,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:12,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:34:12,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 19:34:12,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 19:34:12,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:12,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:34:12,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2005943680] [2025-03-03 19:34:12,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:12,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:34:12,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:34:12,739 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 19:34:12,740 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 19:34:12,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 19:34:12,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 19:34:12,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:12,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:34:12,862 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:34:12,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 19:34:12,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 19:34:12,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:12,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:34:13,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:34:13,036 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:34:13,036 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:34:13,047 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 19:34:13,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:34:13,245 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 19:34:13,410 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:34:13,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:34:13 BoogieIcfgContainer [2025-03-03 19:34:13,412 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:34:13,413 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:34:13,413 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:34:13,413 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:34:13,414 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:34:09" (3/4) ... [2025-03-03 19:34:13,415 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:34:13,416 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:34:13,417 INFO L158 Benchmark]: Toolchain (without parser) took 4860.18ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 112.0MB in the beginning and 137.1MB in the end (delta: -25.1MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2025-03-03 19:34:13,418 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:34:13,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.48ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 97.5MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:34:13,418 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.68ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 95.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:34:13,419 INFO L158 Benchmark]: Boogie Preprocessor took 32.67ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 92.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:34:13,419 INFO L158 Benchmark]: IcfgBuilder took 374.41ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 70.7MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 19:34:13,420 INFO L158 Benchmark]: TraceAbstraction took 4170.12ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 70.3MB in the beginning and 137.1MB in the end (delta: -66.8MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2025-03-03 19:34:13,420 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 184.5MB. Free memory was 137.1MB in the beginning and 137.1MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:34:13,421 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.21ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.48ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 97.5MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.68ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 95.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.67ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 92.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 374.41ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 70.7MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4170.12ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 70.3MB in the beginning and 137.1MB in the end (delta: -66.8MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 184.5MB. Free memory was 137.1MB in the beginning and 137.1MB in the end (delta: 33.1kB). 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 146, overapproximation of someBinaryFLOATComparisonOperation at line 150, overapproximation of someBinaryFLOATComparisonOperation at line 172, overapproximation of someBinaryFLOATComparisonOperation at line 148, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 152, overapproximation of someBinaryDOUBLEComparisonOperation at line 172, overapproximation of someBinaryArithmeticFLOAToperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 0; [L26] signed short int var_1_9 = 0; [L27] signed short int var_1_10 = 8; [L28] signed char var_1_11 = 1; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = -2; [L31] signed char var_1_14 = 8; [L32] signed char var_1_15 = 0; [L33] signed char var_1_16 = 10; [L34] signed char var_1_17 = 32; [L35] unsigned char var_1_18 = 0; [L36] signed char var_1_19 = -1; [L37] signed short int var_1_20 = 100; [L38] signed short int var_1_22 = 29265; [L39] float var_1_23 = 31.6; [L40] float var_1_24 = 9.2; [L41] float var_1_25 = 15.6; [L42] float var_1_26 = 25.25; [L43] unsigned long int var_1_27 = 256; [L44] double var_1_29 = 15.86; [L45] double var_1_30 = 64.25; [L46] signed short int var_1_31 = 10; [L47] signed short int var_1_32 = 0; [L48] signed short int var_1_33 = 8; [L49] unsigned char var_1_34 = 1; [L50] unsigned char var_1_35 = 0; [L51] unsigned short int var_1_36 = 5; [L52] signed long int var_1_37 = -1; [L53] signed long int var_1_38 = 5; [L54] unsigned short int var_1_39 = 100; VAL [isInitial=0, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L176] isInitial = 1 [L177] FCALL initially() [L178] COND TRUE 1 [L179] FCALL updateLastVariables() [L180] CALL updateVariables() [L108] var_1_6 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_7=0, var_1_8=0, var_1_9=0] [L109] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_7=0, var_1_8=0, var_1_9=0] [L110] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L110] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L111] var_1_7 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L112] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L113] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L113] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L114] var_1_9 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L115] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L116] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L116] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=8, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L117] var_1_10 = __VERIFIER_nondet_short() [L118] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L118] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L119] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L119] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L120] var_1_12 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L121] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L122] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L122] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-2, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L123] var_1_13 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L124] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L125] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L125] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=8, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L126] var_1_14 = __VERIFIER_nondet_char() [L127] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L127] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L128] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L128] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L129] var_1_15 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L130] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L131] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L131] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=10, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L132] var_1_16 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L133] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L134] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L134] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L135] var_1_17 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L136] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L137] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L137] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L138] var_1_19 = __VERIFIER_nondet_char() [L139] CALL assume_abort_if_not(var_1_19 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L139] RET assume_abort_if_not(var_1_19 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L140] CALL assume_abort_if_not(var_1_19 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L140] RET assume_abort_if_not(var_1_19 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L141] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L141] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=29265, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L142] var_1_22 = __VERIFIER_nondet_short() [L143] CALL assume_abort_if_not(var_1_22 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L143] RET assume_abort_if_not(var_1_22 >= 16382) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L144] CALL assume_abort_if_not(var_1_22 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L144] RET assume_abort_if_not(var_1_22 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_24=46/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L145] var_1_24 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L146] RET assume_abort_if_not((var_1_24 >= -461168.6018427382800e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 4611686.018427382800e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_25=78/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L147] var_1_25 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L148] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_26=101/4, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L149] var_1_26 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L150] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_30=257/4, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L151] var_1_30 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L152] RET assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=0, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L153] var_1_32 = __VERIFIER_nondet_short() [L154] CALL assume_abort_if_not(var_1_32 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L154] RET assume_abort_if_not(var_1_32 >= -32767) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L155] CALL assume_abort_if_not(var_1_32 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L155] RET assume_abort_if_not(var_1_32 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=0, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L156] var_1_35 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_35 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L157] RET assume_abort_if_not(var_1_35 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L158] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L158] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L159] var_1_37 = __VERIFIER_nondet_long() [L160] CALL assume_abort_if_not(var_1_37 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L160] RET assume_abort_if_not(var_1_37 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L161] CALL assume_abort_if_not(var_1_37 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L161] RET assume_abort_if_not(var_1_37 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=5, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L162] var_1_38 = __VERIFIER_nondet_long() [L163] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L163] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L164] CALL assume_abort_if_not(var_1_38 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L164] RET assume_abort_if_not(var_1_38 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=100, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L165] var_1_39 = __VERIFIER_nondet_ushort() [L166] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L166] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L167] CALL assume_abort_if_not(var_1_39 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L167] RET assume_abort_if_not(var_1_39 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=793/50, var_1_31=10, var_1_32=-32767, var_1_33=8, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L180] RET updateVariables() [L181] CALL step() [L58] var_1_29 = var_1_30 [L59] var_1_31 = var_1_32 [L60] var_1_33 = var_1_32 [L61] var_1_34 = var_1_35 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L62] COND FALSE !((var_1_37 - var_1_38) <= var_1_31) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L67] var_1_8 = (var_1_9 - (2 + var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L68] COND TRUE var_1_22 != var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_23=158/5, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L69] COND TRUE var_1_10 <= var_1_17 [L70] var_1_23 = (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=256, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L75] COND TRUE ! ((var_1_9 - var_1_22) > var_1_12) [L76] var_1_27 = var_1_15 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=0, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L78] COND FALSE !(var_1_23 == var_1_23) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=100, var_1_22=16382, var_1_27=0, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L83] COND TRUE (- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23) [L84] var_1_20 = ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L88] COND FALSE !(\read(var_1_18)) [L91] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L93] COND TRUE \read(var_1_1) [L94] var_1_11 = (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L181] RET step() [L182] CALL, EXPR property() [L172-L173] return ((((((var_1_18 ? (var_1_1 == ((unsigned char) (((-128 <= var_1_20) || (var_1_23 >= var_1_23)) && var_1_6))) : (var_1_1 == ((unsigned char) var_1_7))) && (var_1_8 == ((signed short int) (var_1_9 - (2 + var_1_10))))) && (var_1_1 ? (var_1_11 == ((signed char) (var_1_12 + ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) : ((var_1_27 >= var_1_14) ? (var_1_11 == ((signed char) ((var_1_15 + var_1_16) - var_1_17))) : (var_1_7 ? (var_1_11 == ((signed char) var_1_16)) : (var_1_11 == ((signed char) var_1_12)))))) && ((var_1_23 == var_1_23) ? ((var_1_15 >= (var_1_27 / var_1_19)) ? (var_1_18 == ((unsigned char) var_1_7)) : 1) : 1)) && (((- ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))) > (1.625 * var_1_23)) ? (var_1_20 == ((signed short int) ((var_1_22 - (var_1_16 + var_1_15)) - var_1_10))) : (var_1_20 == ((signed short int) var_1_19)))) && ((var_1_22 != var_1_12) ? ((var_1_10 <= var_1_17) ? (var_1_23 == ((float) (var_1_24 + ((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))) : 1) : (var_1_23 == ((float) var_1_25)))) && ((! ((var_1_9 - var_1_22) > var_1_12)) ? (var_1_27 == ((unsigned long int) var_1_15)) : 1) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L182] RET, EXPR property() [L182] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=2, var_1_13=-1, var_1_14=-1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=16382, var_1_22=16382, var_1_27=0, var_1_29=2, var_1_30=2, var_1_31=-32767, var_1_32=-32767, var_1_33=-32767, var_1_34=1, var_1_35=1, var_1_36=5, var_1_37=-1, var_1_38=32765, var_1_39=0, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 4, TraceHistogramMax: 39, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 312 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 289 mSDsluCounter, 593 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 230 mSDsCounter, 167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 229 IncrementalHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 167 mSolverCounterUnsat, 363 mSDtfsCounter, 229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 711 GetRequests, 696 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1633 NumberOfCodeBlocks, 1633 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1392 ConstructedInterpolants, 0 QuantifiedInterpolants, 2551 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1039 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 17573/17784 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 19:34:13,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-29.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 b3da19090aa76dca033c6d25fa7336bc4f04f864a604dbf4ea33dc233ad87a23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:34:15,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:34:15,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:34:15,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:34:15,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:34:15,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:34:15,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:34:15,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:34:15,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:34:15,350 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:34:15,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:34:15,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:34:15,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:34:15,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:34:15,353 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:34:15,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:34:15,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:34:15,354 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:34:15,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:34:15,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:34:15,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:34:15,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:34:15,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:34:15,354 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:34:15,355 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:34:15,355 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:34:15,355 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:34:15,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:34:15,355 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:34:15,355 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:34:15,355 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:34:15,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:34:15,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:34:15,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:34:15,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:34:15,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:34:15,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:34:15,356 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:34:15,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:34:15,357 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:34:15,357 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:34:15,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:34:15,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:34:15,357 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:34:15,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:34:15,357 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 -> b3da19090aa76dca033c6d25fa7336bc4f04f864a604dbf4ea33dc233ad87a23 [2025-03-03 19:34:15,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:34:15,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:34:15,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:34:15,635 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:34:15,635 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:34:15,636 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-10_file-29.i [2025-03-03 19:34:16,798 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/953d75934/fa0c8151759148b5a6dd8e5653a8ad38/FLAGfcb54cb6d [2025-03-03 19:34:17,014 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:34:17,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-29.i [2025-03-03 19:34:17,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/953d75934/fa0c8151759148b5a6dd8e5653a8ad38/FLAGfcb54cb6d [2025-03-03 19:34:17,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/953d75934/fa0c8151759148b5a6dd8e5653a8ad38 [2025-03-03 19:34:17,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:34:17,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:34:17,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:34:17,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:34:17,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:34:17,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:34:17" (1/1) ... [2025-03-03 19:34:17,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b88d5d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:17, skipping insertion in model container [2025-03-03 19:34:17,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:34:17" (1/1) ... [2025-03-03 19:34:17,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:34:17,169 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-10_file-29.i[915,928] [2025-03-03 19:34:17,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:34:17,241 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:34:17,251 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-10_file-29.i[915,928] [2025-03-03 19:34:17,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:34:17,308 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:34:17,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:17 WrapperNode [2025-03-03 19:34:17,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:34:17,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:34:17,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:34:17,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:34:17,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:17" (1/1) ... [2025-03-03 19:34:17,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:17" (1/1) ... [2025-03-03 19:34:17,358 INFO L138 Inliner]: procedures = 27, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2025-03-03 19:34:17,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:34:17,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:34:17,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:34:17,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:34:17,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:17" (1/1) ... [2025-03-03 19:34:17,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:17" (1/1) ... [2025-03-03 19:34:17,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:17" (1/1) ... [2025-03-03 19:34:17,387 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 19:34:17,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:17" (1/1) ... [2025-03-03 19:34:17,391 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:17" (1/1) ... [2025-03-03 19:34:17,401 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:17" (1/1) ... [2025-03-03 19:34:17,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:17" (1/1) ... [2025-03-03 19:34:17,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:17" (1/1) ... [2025-03-03 19:34:17,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:17" (1/1) ... [2025-03-03 19:34:17,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:34:17,415 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:34:17,416 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:34:17,417 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:34:17,417 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:17" (1/1) ... [2025-03-03 19:34:17,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:34:17,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:34:17,449 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 19:34:17,453 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 19:34:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:34:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:34:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:34:17,472 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:34:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:34:17,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:34:17,543 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:34:17,545 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:34:19,302 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 19:34:19,303 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:34:19,314 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:34:19,314 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:34:19,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:34:19 BoogieIcfgContainer [2025-03-03 19:34:19,315 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:34:19,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:34:19,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:34:19,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:34:19,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:34:17" (1/3) ... [2025-03-03 19:34:19,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1801c3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:34:19, skipping insertion in model container [2025-03-03 19:34:19,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:34:17" (2/3) ... [2025-03-03 19:34:19,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1801c3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:34:19, skipping insertion in model container [2025-03-03 19:34:19,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:34:19" (3/3) ... [2025-03-03 19:34:19,322 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-29.i [2025-03-03 19:34:19,333 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:34:19,335 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-29.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:34:19,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:34:19,395 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;@5713baac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:34:19,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:34:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 50 states have internal predecessors, (65), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 19:34:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-03 19:34:19,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:19,412 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:34:19,413 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:19,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:19,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1743909020, now seen corresponding path program 1 times [2025-03-03 19:34:19,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:34:19,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186991661] [2025-03-03 19:34:19,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:19,430 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 19:34:19,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:34:19,434 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 19:34:19,436 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 19:34:19,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 19:34:19,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 19:34:19,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:19,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:19,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:34:19,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 944 proven. 0 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2025-03-03 19:34:19,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:34:19,887 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:34:19,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186991661] [2025-03-03 19:34:19,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186991661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:19,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:34:19,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:34:19,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305892036] [2025-03-03 19:34:19,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:19,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:34:19,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:34:19,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:34:19,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:34:19,909 INFO L87 Difference]: Start difference. First operand has 91 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 50 states have internal predecessors, (65), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-03 19:34:19,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:19,932 INFO L93 Difference]: Finished difference Result 176 states and 320 transitions. [2025-03-03 19:34:19,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:34:19,934 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 233 [2025-03-03 19:34:19,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:19,941 INFO L225 Difference]: With dead ends: 176 [2025-03-03 19:34:19,942 INFO L226 Difference]: Without dead ends: 88 [2025-03-03 19:34:19,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 232 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 19:34:19,950 INFO L435 NwaCegarLoop]: 138 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, 138 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 19:34:19,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:34:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-03 19:34:19,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-03 19:34:19,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 19:34:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2025-03-03 19:34:19,990 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 233 [2025-03-03 19:34:19,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:19,990 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2025-03-03 19:34:19,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-03 19:34:19,991 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2025-03-03 19:34:19,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-03 19:34:19,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:19,995 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:34:20,007 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 19:34:20,196 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 19:34:20,196 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:20,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:20,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1586470311, now seen corresponding path program 1 times [2025-03-03 19:34:20,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:34:20,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763675022] [2025-03-03 19:34:20,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:20,198 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 19:34:20,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:34:20,200 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 19:34:20,202 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 19:34:20,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 19:34:20,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 19:34:20,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:20,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:20,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 19:34:20,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:21,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1464 proven. 45 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2025-03-03 19:34:21,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:34:21,181 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:34:21,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763675022] [2025-03-03 19:34:21,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763675022] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:34:21,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1508518001] [2025-03-03 19:34:21,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:21,181 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 19:34:21,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 19:34:21,183 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 19:34:21,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-03 19:34:21,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 19:34:21,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 19:34:21,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:21,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:21,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 19:34:21,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-03 19:34:22,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:34:22,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1508518001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:22,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:34:22,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 19:34:22,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522176359] [2025-03-03 19:34:22,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:22,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:34:22,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:34:22,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:34:22,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:34:22,241 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-03 19:34:23,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:34:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:23,469 INFO L93 Difference]: Finished difference Result 258 states and 408 transitions. [2025-03-03 19:34:23,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:34:23,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 233 [2025-03-03 19:34:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:23,491 INFO L225 Difference]: With dead ends: 258 [2025-03-03 19:34:23,491 INFO L226 Difference]: Without dead ends: 173 [2025-03-03 19:34:23,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:34:23,493 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 23 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:23,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 267 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 19:34:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-03 19:34:23,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2025-03-03 19:34:23,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 90 states have internal predecessors, (115), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 19:34:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 271 transitions. [2025-03-03 19:34:23,526 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 271 transitions. Word has length 233 [2025-03-03 19:34:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:23,527 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 271 transitions. [2025-03-03 19:34:23,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-03 19:34:23,527 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 271 transitions. [2025-03-03 19:34:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-03 19:34:23,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:23,531 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:34:23,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-03-03 19:34:23,742 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 19:34:23,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 19:34:23,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:23,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:23,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1615099462, now seen corresponding path program 1 times [2025-03-03 19:34:23,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:34:23,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506087126] [2025-03-03 19:34:23,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:23,933 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 19:34:23,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:34:23,935 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 19:34:23,936 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 19:34:23,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 19:34:24,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 19:34:24,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:24,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:24,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 19:34:24,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1464 proven. 45 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2025-03-03 19:34:24,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:34:24,519 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:34:24,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506087126] [2025-03-03 19:34:24,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506087126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:34:24,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2139979440] [2025-03-03 19:34:24,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:24,520 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 19:34:24,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 19:34:24,522 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 19:34:24,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-03 19:34:24,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 19:34:25,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 19:34:25,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:25,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:25,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 19:34:25,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-03 19:34:25,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:34:25,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2139979440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:34:25,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:34:25,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 19:34:25,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37320113] [2025-03-03 19:34:25,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:34:25,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:34:25,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:34:25,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:34:25,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:34:25,368 INFO L87 Difference]: Start difference. First operand 171 states and 271 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-03 19:34:26,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:26,763 INFO L93 Difference]: Finished difference Result 505 states and 803 transitions. [2025-03-03 19:34:26,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:34:26,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 233 [2025-03-03 19:34:26,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:26,769 INFO L225 Difference]: With dead ends: 505 [2025-03-03 19:34:26,771 INFO L226 Difference]: Without dead ends: 337 [2025-03-03 19:34:26,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:34:26,773 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 128 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:26,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 380 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 19:34:26,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-03 19:34:26,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2025-03-03 19:34:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 174 states have (on average 1.2528735632183907) internal successors, (218), 174 states have internal predecessors, (218), 156 states have call successors, (156), 4 states have call predecessors, (156), 4 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-03 19:34:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 530 transitions. [2025-03-03 19:34:26,825 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 530 transitions. Word has length 233 [2025-03-03 19:34:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:26,826 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 530 transitions. [2025-03-03 19:34:26,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-03 19:34:26,827 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 530 transitions. [2025-03-03 19:34:26,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-03 19:34:26,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:26,830 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:34:26,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-03 19:34:27,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-03-03 19:34:27,230 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 19:34:27,231 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:27,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:27,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1792364153, now seen corresponding path program 1 times [2025-03-03 19:34:27,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:34:27,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619018942] [2025-03-03 19:34:27,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:27,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:34:27,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:34:27,233 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 19:34:27,235 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 19:34:27,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 19:34:27,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 19:34:27,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:27,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:27,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 19:34:27,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1464 proven. 45 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2025-03-03 19:34:27,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:34:27,779 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:34:27,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619018942] [2025-03-03 19:34:27,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1619018942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:34:27,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [831834294] [2025-03-03 19:34:27,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:27,780 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 19:34:27,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 19:34:27,783 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 19:34:27,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-03 19:34:27,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 19:34:28,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 19:34:28,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:28,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:28,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:34:28,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:34:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1338 proven. 36 refuted. 0 times theorem prover too weak. 1590 trivial. 0 not checked. [2025-03-03 19:34:30,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:34:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 78 proven. 36 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2025-03-03 19:34:30,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [831834294] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:34:30,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:34:30,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2025-03-03 19:34:30,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695434225] [2025-03-03 19:34:30,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:34:30,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:34:30,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:34:30,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:34:30,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:34:30,824 INFO L87 Difference]: Start difference. First operand 335 states and 530 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 4 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2025-03-03 19:34:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:34:41,856 INFO L93 Difference]: Finished difference Result 901 states and 1382 transitions. [2025-03-03 19:34:41,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 19:34:41,858 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 4 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) Word has length 233 [2025-03-03 19:34:41,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:34:41,864 INFO L225 Difference]: With dead ends: 901 [2025-03-03 19:34:41,864 INFO L226 Difference]: Without dead ends: 569 [2025-03-03 19:34:41,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 703 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 19:34:41,867 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 426 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 649 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 649 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-03-03 19:34:41,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 393 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [649 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2025-03-03 19:34:41,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-03 19:34:41,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 371. [2025-03-03 19:34:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 202 states have (on average 1.2079207920792079) internal successors, (244), 202 states have internal predecessors, (244), 156 states have call successors, (156), 12 states have call predecessors, (156), 12 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-03 19:34:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 556 transitions. [2025-03-03 19:34:41,916 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 556 transitions. Word has length 233 [2025-03-03 19:34:41,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:34:41,918 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 556 transitions. [2025-03-03 19:34:41,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 4 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2025-03-03 19:34:41,918 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 556 transitions. [2025-03-03 19:34:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-03 19:34:41,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:34:41,920 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:34:41,933 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 (7)] Ended with exit code 0 [2025-03-03 19:34:42,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2025-03-03 19:34:42,321 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 19:34:42,321 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:34:42,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:34:42,322 INFO L85 PathProgramCache]: Analyzing trace with hash 926523798, now seen corresponding path program 1 times [2025-03-03 19:34:42,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:34:42,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484628233] [2025-03-03 19:34:42,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:34:42,322 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 19:34:42,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:34:42,326 INFO L229 MonitoredProcess]: Starting monitored process 9 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 19:34:42,327 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 (9)] Waiting until timeout for monitored process [2025-03-03 19:34:42,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 19:34:42,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 19:34:42,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:34:42,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:34:42,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 19:34:42,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:35:02,563 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true