./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-71.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 f17c0065d06bd69e701e1c7b4b8519084c98c9a0a14ee3995ac94291f3ffbf91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:59:29,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:59:29,911 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 22:59:29,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:59:29,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:59:29,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:59:29,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:59:29,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:59:29,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:59:29,937 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:59:29,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:59:29,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:59:29,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:59:29,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:59:29,938 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:59:29,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:59:29,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:59:29,939 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 22:59:29,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:59:29,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 22:59:29,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:59:29,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:59:29,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:59:29,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:59:29,939 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 22:59:29,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:59:29,939 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:59:29,939 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:59:29,939 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:59:29,940 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:59:29,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:59:29,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:59:29,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:59:29,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:59:29,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:59:29,940 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:59:29,941 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:59:29,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:59:29,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:59:29,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:59:29,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:59:29,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:59:29,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:59:29,941 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 -> f17c0065d06bd69e701e1c7b4b8519084c98c9a0a14ee3995ac94291f3ffbf91 [2025-03-16 22:59:30,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:59:30,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:59:30,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:59:30,171 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:59:30,171 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:59:30,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-71.i [2025-03-16 22:59:31,299 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/546ad7f98/fdfd96ccef2d4018bbc9764a32ad0148/FLAGc233a72f1 [2025-03-16 22:59:31,516 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:59:31,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-71.i [2025-03-16 22:59:31,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/546ad7f98/fdfd96ccef2d4018bbc9764a32ad0148/FLAGc233a72f1 [2025-03-16 22:59:31,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/546ad7f98/fdfd96ccef2d4018bbc9764a32ad0148 [2025-03-16 22:59:31,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:59:31,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:59:31,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:59:31,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:59:31,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:59:31,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:59:31" (1/1) ... [2025-03-16 22:59:31,541 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c199b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:31, skipping insertion in model container [2025-03-16 22:59:31,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:59:31" (1/1) ... [2025-03-16 22:59:31,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:59:31,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-71.i[919,932] [2025-03-16 22:59:31,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:59:31,715 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:59:31,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-71.i[919,932] [2025-03-16 22:59:31,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:59:31,763 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:59:31,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:31 WrapperNode [2025-03-16 22:59:31,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:59:31,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:59:31,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:59:31,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:59:31,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:31" (1/1) ... [2025-03-16 22:59:31,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:31" (1/1) ... [2025-03-16 22:59:31,790 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2025-03-16 22:59:31,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:59:31,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:59:31,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:59:31,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:59:31,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:31" (1/1) ... [2025-03-16 22:59:31,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:31" (1/1) ... [2025-03-16 22:59:31,798 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:31" (1/1) ... [2025-03-16 22:59:31,809 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-16 22:59:31,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:31" (1/1) ... [2025-03-16 22:59:31,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:31" (1/1) ... [2025-03-16 22:59:31,813 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:31" (1/1) ... [2025-03-16 22:59:31,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:31" (1/1) ... [2025-03-16 22:59:31,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:31" (1/1) ... [2025-03-16 22:59:31,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:31" (1/1) ... [2025-03-16 22:59:31,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:59:31,817 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:59:31,817 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:59:31,817 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:59:31,818 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:31" (1/1) ... [2025-03-16 22:59:31,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:59:31,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:59:31,843 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-16 22:59:31,845 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-16 22:59:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:59:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 22:59:31,861 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 22:59:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:59:31,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:59:31,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:59:31,920 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:59:31,922 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:59:32,115 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 22:59:32,116 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:59:32,123 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:59:32,124 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:59:32,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:59:32 BoogieIcfgContainer [2025-03-16 22:59:32,124 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:59:32,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:59:32,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:59:32,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:59:32,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:59:31" (1/3) ... [2025-03-16 22:59:32,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e3e360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:59:32, skipping insertion in model container [2025-03-16 22:59:32,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:31" (2/3) ... [2025-03-16 22:59:32,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e3e360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:59:32, skipping insertion in model container [2025-03-16 22:59:32,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:59:32" (3/3) ... [2025-03-16 22:59:32,131 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-71.i [2025-03-16 22:59:32,140 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:59:32,141 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-71.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:59:32,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:59:32,182 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;@6ebc113b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:59:32,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:59:32,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 22:59:32,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 22:59:32,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:59:32,192 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:59:32,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:59:32,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:59:32,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1207753922, now seen corresponding path program 1 times [2025-03-16 22:59:32,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:59:32,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729027045] [2025-03-16 22:59:32,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:59:32,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:59:32,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 22:59:32,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 22:59:32,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:59:32,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:59:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-16 22:59:32,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:59:32,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729027045] [2025-03-16 22:59:32,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729027045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:59:32,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313014169] [2025-03-16 22:59:32,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:59:32,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:59:32,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:59:32,398 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-16 22:59:32,399 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-16 22:59:32,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 22:59:32,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 22:59:32,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:59:32,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:59:32,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 22:59:32,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:59:32,577 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-16 22:59:32,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:59:32,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313014169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:59:32,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:59:32,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 22:59:32,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552668632] [2025-03-16 22:59:32,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:59:32,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 22:59:32,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:59:32,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 22:59:32,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 22:59:32,600 INFO L87 Difference]: Start difference. First operand has 55 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-16 22:59:32,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:59:32,619 INFO L93 Difference]: Finished difference Result 107 states and 189 transitions. [2025-03-16 22:59:32,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 22:59:32,621 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 128 [2025-03-16 22:59:32,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:59:32,625 INFO L225 Difference]: With dead ends: 107 [2025-03-16 22:59:32,626 INFO L226 Difference]: Without dead ends: 53 [2025-03-16 22:59:32,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-16 22:59:32,630 INFO L435 NwaCegarLoop]: 81 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, 81 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-16 22:59:32,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:59:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-16 22:59:32,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-16 22:59:32,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 22:59:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2025-03-16 22:59:32,654 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 128 [2025-03-16 22:59:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:59:32,655 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2025-03-16 22:59:32,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-16 22:59:32,655 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2025-03-16 22:59:32,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 22:59:32,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:59:32,657 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:59:32,663 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-16 22:59:32,857 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-16 22:59:32,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:59:32,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:59:32,858 INFO L85 PathProgramCache]: Analyzing trace with hash 378742851, now seen corresponding path program 1 times [2025-03-16 22:59:32,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:59:32,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117787064] [2025-03-16 22:59:32,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:59:32,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:59:32,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 22:59:33,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 22:59:33,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:59:33,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 22:59:33,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [696936172] [2025-03-16 22:59:33,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:59:33,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:59:33,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:59:33,021 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-16 22:59:33,023 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-16 22:59:33,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 22:59:33,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 22:59:33,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:59:33,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:59:33,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 22:59:33,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:59:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 42 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2025-03-16 22:59:34,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:59:34,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:59:34,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117787064] [2025-03-16 22:59:34,241 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-16 22:59:34,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696936172] [2025-03-16 22:59:34,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696936172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:59:34,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:59:34,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-16 22:59:34,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349934580] [2025-03-16 22:59:34,241 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-16 22:59:34,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:59:34,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:59:34,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:59:34,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:59:34,244 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-16 22:59:34,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:59:34,551 INFO L93 Difference]: Finished difference Result 164 states and 247 transitions. [2025-03-16 22:59:34,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 22:59:34,552 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 128 [2025-03-16 22:59:34,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:59:34,553 INFO L225 Difference]: With dead ends: 164 [2025-03-16 22:59:34,553 INFO L226 Difference]: Without dead ends: 112 [2025-03-16 22:59:34,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-03-16 22:59:34,554 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 92 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:59:34,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 232 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:59:34,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-16 22:59:34,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2025-03-16 22:59:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-16 22:59:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 144 transitions. [2025-03-16 22:59:34,569 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 144 transitions. Word has length 128 [2025-03-16 22:59:34,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:59:34,569 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 144 transitions. [2025-03-16 22:59:34,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-16 22:59:34,570 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 144 transitions. [2025-03-16 22:59:34,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 22:59:34,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:59:34,571 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:59:34,577 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-16 22:59:34,771 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,SelfDestructingSolverStorable1 [2025-03-16 22:59:34,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:59:34,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:59:34,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1428711612, now seen corresponding path program 1 times [2025-03-16 22:59:34,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:59:34,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751033274] [2025-03-16 22:59:34,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:59:34,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:59:34,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 22:59:34,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 22:59:34,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:59:34,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 22:59:34,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [977039976] [2025-03-16 22:59:34,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:59:34,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:59:34,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:59:34,872 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-16 22:59:34,873 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-16 22:59:34,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 22:59:34,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 22:59:34,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:59:34,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:59:34,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 22:59:34,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 22:59:34,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 22:59:34,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:59:34,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 22:59:35,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 22:59:35,055 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 22:59:35,055 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 22:59:35,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 22:59:35,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:59:35,259 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-16 22:59:35,331 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 22:59:35,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 10:59:35 BoogieIcfgContainer [2025-03-16 22:59:35,333 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 22:59:35,333 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 22:59:35,333 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 22:59:35,333 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 22:59:35,334 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:59:32" (3/4) ... [2025-03-16 22:59:35,337 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 22:59:35,337 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 22:59:35,338 INFO L158 Benchmark]: Toolchain (without parser) took 3801.69ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 54.6MB in the end (delta: 59.1MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. [2025-03-16 22:59:35,338 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:59:35,339 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.17ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 99.4MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:59:35,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.35ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 96.7MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:59:35,339 INFO L158 Benchmark]: Boogie Preprocessor took 25.33ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 93.1MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 22:59:35,340 INFO L158 Benchmark]: IcfgBuilder took 307.03ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 74.4MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 22:59:35,340 INFO L158 Benchmark]: TraceAbstraction took 3206.49ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 54.6MB in the end (delta: 19.0MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2025-03-16 22:59:35,340 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 142.6MB. Free memory was 54.6MB in the beginning and 54.6MB in the end (delta: 27.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 22:59:35,341 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.19ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.17ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 99.4MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.35ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 96.7MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.33ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 93.1MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 307.03ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 74.4MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3206.49ms. Allocated memory is still 142.6MB. Free memory was 73.6MB in the beginning and 54.6MB in the end (delta: 19.0MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 142.6MB. Free memory was 54.6MB in the beginning and 54.6MB in the end (delta: 27.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed char var_1_4 = -1; [L26] signed char var_1_5 = 4; [L27] unsigned short int var_1_9 = 35831; [L28] float var_1_10 = 1.875; [L29] float var_1_11 = 5.8; [L30] float var_1_12 = 2.375; [L31] float var_1_13 = 999999999999.75; [L32] signed short int var_1_14 = 32; [L33] signed short int var_1_15 = 25; [L34] signed short int var_1_16 = 23809; [L35] signed short int var_1_17 = 2; [L36] float var_1_18 = 499.25; [L37] signed long int var_1_19 = -4; [L38] unsigned short int var_1_20 = 10; [L39] unsigned short int var_1_21 = 16; [L40] signed char var_1_22 = -10; [L41] signed char var_1_23 = 25; [L42] float last_1_var_1_12 = 2.375; [L43] signed short int last_1_var_1_14 = 32; [L44] unsigned short int last_1_var_1_20 = 10; [L45] unsigned short int last_1_var_1_21 = 16; [L132] isInitial = 1 [L133] FCALL initially() [L134] COND TRUE 1 [L135] CALL updateLastVariables() [L122] last_1_var_1_12 = var_1_12 [L123] last_1_var_1_14 = var_1_14 [L124] last_1_var_1_20 = var_1_20 [L125] last_1_var_1_21 = var_1_21 [L135] RET updateLastVariables() [L136] CALL updateVariables() [L88] var_1_2 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L89] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L90] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L90] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L91] var_1_3 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L92] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L93] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L93] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L94] var_1_4 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L95] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L96] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L96] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L97] var_1_5 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L98] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L99] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L99] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L100] var_1_9 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_9 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L101] RET assume_abort_if_not(var_1_9 >= 32767) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L102] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L102] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L103] var_1_11 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L104] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L105] var_1_13 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L106] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L107] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L107] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L108] var_1_15 = __VERIFIER_nondet_short() [L109] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L109] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L110] CALL assume_abort_if_not(var_1_15 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L110] RET assume_abort_if_not(var_1_15 <= 16383) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L111] var_1_16 = __VERIFIER_nondet_short() [L112] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L112] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L113] CALL assume_abort_if_not(var_1_16 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L113] RET assume_abort_if_not(var_1_16 <= 32766) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L114] var_1_17 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L115] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L116] CALL assume_abort_if_not(var_1_17 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L116] RET assume_abort_if_not(var_1_17 <= 16383) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L117] var_1_23 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_23 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L118] RET assume_abort_if_not(var_1_23 >= -127) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L119] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L119] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L136] RET updateVariables() [L137] CALL step() [L49] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L50] COND FALSE !((var_1_4 - var_1_5) > ((last_1_var_1_14 + last_1_var_1_20) * last_1_var_1_21)) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L60] COND FALSE !(! (var_1_5 < var_1_1)) [L67] var_1_14 = ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) < ((var_1_15 - (var_1_16 - var_1_17)))) ? (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) : ((var_1_15 - (var_1_16 - var_1_17))))) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=0, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L69] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L70] COND FALSE !(last_1_var_1_12 >= ((var_1_11 / var_1_13) / 31.9f)) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L77] var_1_18 = ((((((((255.5f) > (var_1_11)) ? (255.5f) : (var_1_11)))) > (5.5f)) ? (((((255.5f) > (var_1_11)) ? (255.5f) : (var_1_11)))) : (5.5f))) [L78] var_1_20 = var_1_15 [L79] var_1_21 = var_1_5 [L80] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=511/2, var_1_19=-4, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=-127, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L81] COND TRUE \read(var_1_3) [L82] var_1_19 = ((((var_1_17) > ((((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9))) + ((((var_1_16) > (var_1_21)) ? (var_1_16) : (var_1_21)))))) ? (var_1_17) : ((((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9))) + ((((var_1_16) > (var_1_21)) ? (var_1_16) : (var_1_21))))))) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=511/2, var_1_19=16383, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=-127, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L137] RET step() [L138] CALL, EXPR property() [L128-L129] return ((((((((var_1_2 ? (((var_1_4 - var_1_5) > ((last_1_var_1_14 + last_1_var_1_20) * last_1_var_1_21)) ? (var_1_1 == ((unsigned short int) (var_1_9 - var_1_5))) : 1) : (var_1_3 ? (var_1_1 == ((unsigned short int) 32)) : (var_1_1 == ((unsigned short int) var_1_5)))) && (var_1_10 == ((float) var_1_11))) && ((last_1_var_1_12 >= ((var_1_11 / var_1_13) / 31.9f)) ? ((var_1_14 > var_1_4) ? (var_1_12 == ((float) var_1_11)) : (var_1_12 == ((float) var_1_11))) : 1)) && ((! (var_1_5 < var_1_1)) ? ((last_1_var_1_14 >= var_1_1) ? (var_1_14 == ((signed short int) (((((128) < (((((2) < (var_1_4)) ? (2) : (var_1_4))))) ? (128) : (((((2) < (var_1_4)) ? (2) : (var_1_4)))))) + var_1_5))) : (var_1_14 == ((signed short int) ((var_1_5 - var_1_15) + var_1_4)))) : (var_1_14 == ((signed short int) ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) < ((var_1_15 - (var_1_16 - var_1_17)))) ? (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) : ((var_1_15 - (var_1_16 - var_1_17))))))))) && (var_1_18 == ((float) ((((((((255.5f) > (var_1_11)) ? (255.5f) : (var_1_11)))) > (5.5f)) ? (((((255.5f) > (var_1_11)) ? (255.5f) : (var_1_11)))) : (5.5f)))))) && (var_1_3 ? (var_1_19 == ((signed long int) ((((var_1_17) > ((((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9))) + ((((var_1_16) > (var_1_21)) ? (var_1_16) : (var_1_21)))))) ? (var_1_17) : ((((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9))) + ((((var_1_16) > (var_1_21)) ? (var_1_16) : (var_1_21))))))))) : (var_1_19 == ((signed long int) var_1_5)))) && (var_1_20 == ((unsigned short int) var_1_15))) && (var_1_21 == ((unsigned short int) var_1_5))) && (var_1_22 == ((signed char) var_1_23)) ; [L138] RET, EXPR property() [L138] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=511/2, var_1_19=16383, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=-127, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=0, var_1_16=16383, var_1_17=16383, var_1_18=511/2, var_1_19=16383, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=-127, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 106 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 313 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 187 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 170 IncrementalHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 126 mSDtfsCounter, 170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 768 NumberOfCodeBlocks, 768 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 381 ConstructedInterpolants, 0 QuantifiedInterpolants, 1634 SizeOfPredicates, 7 NumberOfNonLiveVariables, 638 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 2438/2520 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-16 22:59:35,358 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_codestructure_dependencies_file-71.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 f17c0065d06bd69e701e1c7b4b8519084c98c9a0a14ee3995ac94291f3ffbf91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:59:37,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:59:37,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 22:59:37,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:59:37,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:59:37,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:59:37,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:59:37,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:59:37,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:59:37,192 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:59:37,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:59:37,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:59:37,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:59:37,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:59:37,194 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:59:37,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:59:37,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:59:37,194 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 22:59:37,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 22:59:37,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:59:37,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:59:37,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:59:37,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:59:37,195 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 22:59:37,195 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 22:59:37,195 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 22:59:37,195 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 22:59:37,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:59:37,195 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:59:37,195 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:59:37,196 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:59:37,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:59:37,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:59:37,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:59:37,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:59:37,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:59:37,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:59:37,196 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:59:37,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:59:37,197 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 22:59:37,197 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 22:59:37,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:59:37,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:59:37,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:59:37,197 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:59:37,197 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 -> f17c0065d06bd69e701e1c7b4b8519084c98c9a0a14ee3995ac94291f3ffbf91 [2025-03-16 22:59:37,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:59:37,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:59:37,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:59:37,445 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:59:37,445 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:59:37,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-71.i [2025-03-16 22:59:38,587 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/380830818/0afee27457b54ee8b5668ab629cf72a6/FLAGecbc1b99a [2025-03-16 22:59:38,789 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:59:38,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-71.i [2025-03-16 22:59:38,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/380830818/0afee27457b54ee8b5668ab629cf72a6/FLAGecbc1b99a [2025-03-16 22:59:39,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/380830818/0afee27457b54ee8b5668ab629cf72a6 [2025-03-16 22:59:39,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:59:39,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:59:39,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:59:39,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:59:39,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:59:39,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:59:39" (1/1) ... [2025-03-16 22:59:39,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de22ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:39, skipping insertion in model container [2025-03-16 22:59:39,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:59:39" (1/1) ... [2025-03-16 22:59:39,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:59:39,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_codestructure_dependencies_file-71.i[919,932] [2025-03-16 22:59:39,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:59:39,298 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:59:39,305 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-71.i[919,932] [2025-03-16 22:59:39,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:59:39,338 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:59:39,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:39 WrapperNode [2025-03-16 22:59:39,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:59:39,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:59:39,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:59:39,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:59:39,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:39" (1/1) ... [2025-03-16 22:59:39,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:39" (1/1) ... [2025-03-16 22:59:39,373 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2025-03-16 22:59:39,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:59:39,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:59:39,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:59:39,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:59:39,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:39" (1/1) ... [2025-03-16 22:59:39,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:39" (1/1) ... [2025-03-16 22:59:39,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:39" (1/1) ... [2025-03-16 22:59:39,395 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-16 22:59:39,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:39" (1/1) ... [2025-03-16 22:59:39,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:39" (1/1) ... [2025-03-16 22:59:39,401 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:39" (1/1) ... [2025-03-16 22:59:39,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:39" (1/1) ... [2025-03-16 22:59:39,406 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:39" (1/1) ... [2025-03-16 22:59:39,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:39" (1/1) ... [2025-03-16 22:59:39,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:59:39,412 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:59:39,412 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:59:39,412 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:59:39,413 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:39" (1/1) ... [2025-03-16 22:59:39,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:59:39,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:59:39,436 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-16 22:59:39,439 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-16 22:59:39,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:59:39,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 22:59:39,460 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 22:59:39,460 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 22:59:39,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:59:39,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:59:39,524 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:59:39,526 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:59:48,270 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 22:59:48,271 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:59:48,280 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:59:48,281 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:59:48,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:59:48 BoogieIcfgContainer [2025-03-16 22:59:48,281 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:59:48,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:59:48,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:59:48,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:59:48,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:59:39" (1/3) ... [2025-03-16 22:59:48,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5446c451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:59:48, skipping insertion in model container [2025-03-16 22:59:48,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:59:39" (2/3) ... [2025-03-16 22:59:48,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5446c451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:59:48, skipping insertion in model container [2025-03-16 22:59:48,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:59:48" (3/3) ... [2025-03-16 22:59:48,290 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-71.i [2025-03-16 22:59:48,300 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:59:48,302 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-71.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:59:48,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:59:48,354 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;@4e67ae08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:59:48,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:59:48,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 22:59:48,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 22:59:48,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:59:48,367 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:59:48,367 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:59:48,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:59:48,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1207753922, now seen corresponding path program 1 times [2025-03-16 22:59:48,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:59:48,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711421092] [2025-03-16 22:59:48,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:59:48,379 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-16 22:59:48,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:59:48,381 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-16 22:59:48,382 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-16 22:59:48,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 22:59:48,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 22:59:48,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:59:48,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:59:48,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 22:59:48,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:59:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-16 22:59:48,812 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:59:48,812 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:59:48,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711421092] [2025-03-16 22:59:48,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711421092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:59:48,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:59:48,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 22:59:48,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068035311] [2025-03-16 22:59:48,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:59:48,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 22:59:48,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:59:48,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 22:59:48,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 22:59:48,831 INFO L87 Difference]: Start difference. First operand has 55 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 32 states have internal predecessors, (43), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-16 22:59:48,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:59:48,846 INFO L93 Difference]: Finished difference Result 107 states and 189 transitions. [2025-03-16 22:59:48,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 22:59:48,849 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 128 [2025-03-16 22:59:48,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:59:48,855 INFO L225 Difference]: With dead ends: 107 [2025-03-16 22:59:48,856 INFO L226 Difference]: Without dead ends: 53 [2025-03-16 22:59:48,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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-16 22:59:48,861 INFO L435 NwaCegarLoop]: 81 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, 81 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-16 22:59:48,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:59:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-16 22:59:48,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-16 22:59:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 22:59:48,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2025-03-16 22:59:48,896 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 128 [2025-03-16 22:59:48,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:59:48,897 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2025-03-16 22:59:48,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-16 22:59:48,897 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2025-03-16 22:59:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 22:59:48,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:59:48,899 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:59:48,913 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-16 22:59:49,104 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-16 22:59:49,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:59:49,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:59:49,105 INFO L85 PathProgramCache]: Analyzing trace with hash 378742851, now seen corresponding path program 1 times [2025-03-16 22:59:49,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:59:49,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126728084] [2025-03-16 22:59:49,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:59:49,106 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-16 22:59:49,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:59:49,108 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-16 22:59:49,110 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-16 22:59:49,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 22:59:49,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 22:59:49,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:59:49,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:59:49,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 22:59:49,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:59:53,471 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-16 22:59:53,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:59:53,472 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 22:59:53,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126728084] [2025-03-16 22:59:53,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126728084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:59:53,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:59:53,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 22:59:53,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279872310] [2025-03-16 22:59:53,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:59:53,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:59:53,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 22:59:53,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:59:53,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:59:53,477 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-16 22:59:55,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:59:58,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 22:59:58,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:59:58,515 INFO L93 Difference]: Finished difference Result 158 states and 242 transitions. [2025-03-16 22:59:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:59:58,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 128 [2025-03-16 22:59:58,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:59:58,560 INFO L225 Difference]: With dead ends: 158 [2025-03-16 22:59:58,560 INFO L226 Difference]: Without dead ends: 106 [2025-03-16 22:59:58,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 22:59:58,563 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 42 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-16 22:59:58,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 221 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-16 22:59:58,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-16 22:59:58,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2025-03-16 22:59:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 47 states have internal predecessors, (57), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-16 22:59:58,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 141 transitions. [2025-03-16 22:59:58,578 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 141 transitions. Word has length 128 [2025-03-16 22:59:58,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:59:58,579 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 141 transitions. [2025-03-16 22:59:58,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-16 22:59:58,579 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 141 transitions. [2025-03-16 22:59:58,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 22:59:58,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:59:58,586 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:59:58,598 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-16 22:59:58,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 22:59:58,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:59:58,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:59:58,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1428711612, now seen corresponding path program 1 times [2025-03-16 22:59:58,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 22:59:58,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650416781] [2025-03-16 22:59:58,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:59:58,788 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-16 22:59:58,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 22:59:58,791 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 22:59:58,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-16 22:59:58,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 22:59:59,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 22:59:59,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:59:59,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:59:59,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 22:59:59,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:01:11,006 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_5~0)) (.cse5 ((_ sign_extend 24) c_~var_1_4~0))) (and (bvslt .cse0 ((_ zero_extend 16) c_~var_1_1~0)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_11~0 (fp.neg .cse1)) (fp.leq c_~var_1_11~0 (fp.neg .cse2))) (and (fp.leq c_~var_1_11~0 .cse1) (fp.geq c_~var_1_11~0 .cse2)))) (let ((.cse7 (bvadd ((_ sign_extend 16) c_~var_1_15~0) (bvneg (bvadd (bvneg ((_ sign_extend 16) c_~var_1_17~0)) ((_ sign_extend 16) c_~var_1_16~0)))))) (let ((.cse6 (= ((_ extract 15 0) .cse7) c_~var_1_14~0)) (.cse3 (bvsgt .cse5 .cse0))) (or (and .cse3 (let ((.cse4 (bvslt .cse5 .cse7))) (or (and .cse4 (= ((_ extract 15 0) .cse5) c_~var_1_14~0)) (and (not .cse4) .cse6)))) (and (let ((.cse8 (bvslt .cse0 .cse7))) (or (and (= ((_ extract 15 0) .cse0) c_~var_1_14~0) .cse8) (and (not .cse8) .cse6))) (not .cse3))))) (= c_~var_1_11~0 c_~var_1_10~0) (not (bvsgt (bvadd (bvneg .cse0) .cse5) (bvmul ((_ zero_extend 16) c_~last_1_var_1_21~0) (bvadd ((_ sign_extend 16) c_~last_1_var_1_14~0) ((_ zero_extend 16) c_~last_1_var_1_20~0))))) (not (fp.geq c_~last_1_var_1_12~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_13~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 319.0 10.0))))) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true