./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-36.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_normal_file-36.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 1f5b5ff94f4836a99c81109f7a8f905db9934ea0167b4088f287cfdf0bb88b00 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:07:23,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:07:23,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:07:23,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:07:23,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:07:23,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:07:23,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:07:23,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:07:23,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:07:23,990 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:07:23,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:07:23,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:07:23,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:07:23,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:07:23,991 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:07:23,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:07:23,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:07:23,992 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:07:23,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:07:23,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:07:23,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:07:23,992 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:07:23,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:07:23,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:07:23,993 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:07:23,993 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:07:23,993 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:07:23,993 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:07:23,993 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:07:23,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:07:23,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:07:23,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:07:23,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:07:23,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:07:23,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:07:23,994 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:07:23,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:07:23,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:07:23,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:07:23,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:07:23,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:07:23,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:07:23,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:07:23,994 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 -> 1f5b5ff94f4836a99c81109f7a8f905db9934ea0167b4088f287cfdf0bb88b00 [2025-03-16 23:07:24,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:07:24,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:07:24,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:07:24,285 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:07:24,285 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:07:24,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-36.i [2025-03-16 23:07:25,459 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03cb300bf/cc18268cbe2042c4b3e4bab1703ddc46/FLAGea0ded140 [2025-03-16 23:07:25,704 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:07:25,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-36.i [2025-03-16 23:07:25,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03cb300bf/cc18268cbe2042c4b3e4bab1703ddc46/FLAGea0ded140 [2025-03-16 23:07:25,721 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03cb300bf/cc18268cbe2042c4b3e4bab1703ddc46 [2025-03-16 23:07:25,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:07:25,724 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:07:25,725 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:07:25,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:07:25,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:07:25,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:07:25" (1/1) ... [2025-03-16 23:07:25,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655b42f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:25, skipping insertion in model container [2025-03-16 23:07:25,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:07:25" (1/1) ... [2025-03-16 23:07:25,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:07:25,822 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-36.i[913,926] [2025-03-16 23:07:25,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:07:25,869 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:07:25,876 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-36.i[913,926] [2025-03-16 23:07:25,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:07:25,911 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:07:25,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:25 WrapperNode [2025-03-16 23:07:25,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:07:25,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:07:25,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:07:25,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:07:25,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:25" (1/1) ... [2025-03-16 23:07:25,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:25" (1/1) ... [2025-03-16 23:07:25,957 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2025-03-16 23:07:25,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:07:25,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:07:25,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:07:25,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:07:25,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:25" (1/1) ... [2025-03-16 23:07:25,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:25" (1/1) ... [2025-03-16 23:07:25,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:25" (1/1) ... [2025-03-16 23:07:25,986 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 23:07:25,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:25" (1/1) ... [2025-03-16 23:07:25,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:25" (1/1) ... [2025-03-16 23:07:25,992 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:25" (1/1) ... [2025-03-16 23:07:25,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:25" (1/1) ... [2025-03-16 23:07:26,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:25" (1/1) ... [2025-03-16 23:07:26,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:25" (1/1) ... [2025-03-16 23:07:26,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:07:26,008 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:07:26,008 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:07:26,008 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:07:26,009 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:25" (1/1) ... [2025-03-16 23:07:26,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:07:26,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:07:26,036 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 23:07:26,038 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 23:07:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:07:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:07:26,055 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:07:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:07:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:07:26,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:07:26,122 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:07:26,124 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:07:26,408 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 23:07:26,408 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:07:26,419 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:07:26,419 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:07:26,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:07:26 BoogieIcfgContainer [2025-03-16 23:07:26,420 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:07:26,423 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:07:26,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:07:26,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:07:26,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:07:25" (1/3) ... [2025-03-16 23:07:26,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a73513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:07:26, skipping insertion in model container [2025-03-16 23:07:26,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:25" (2/3) ... [2025-03-16 23:07:26,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a73513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:07:26, skipping insertion in model container [2025-03-16 23:07:26,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:07:26" (3/3) ... [2025-03-16 23:07:26,430 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-36.i [2025-03-16 23:07:26,440 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:07:26,442 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-36.i that has 2 procedures, 69 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:07:26,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:07:26,491 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;@53f5d334, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:07:26,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:07:26,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 23:07:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-16 23:07:26,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:07:26,506 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:07:26,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:07:26,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:07:26,511 INFO L85 PathProgramCache]: Analyzing trace with hash 862724631, now seen corresponding path program 1 times [2025-03-16 23:07:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:07:26,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183975567] [2025-03-16 23:07:26,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:07:26,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:07:26,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-16 23:07:26,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-16 23:07:26,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:26,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:07:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-16 23:07:26,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:07:26,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183975567] [2025-03-16 23:07:26,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183975567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:07:26,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672056610] [2025-03-16 23:07:26,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:07:26,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:07:26,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:07:26,754 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 23:07:26,756 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 23:07:26,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-16 23:07:26,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-16 23:07:26,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:26,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:07:26,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:07:26,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:07:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-16 23:07:26,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:07:26,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672056610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:07:26,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:07:26,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:07:26,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700445529] [2025-03-16 23:07:26,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:07:26,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:07:26,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:07:26,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:07:26,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:07:26,962 INFO L87 Difference]: Start difference. First operand has 69 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-16 23:07:26,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:07:26,978 INFO L93 Difference]: Finished difference Result 135 states and 240 transitions. [2025-03-16 23:07:26,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:07:26,980 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 160 [2025-03-16 23:07:26,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:07:26,984 INFO L225 Difference]: With dead ends: 135 [2025-03-16 23:07:26,984 INFO L226 Difference]: Without dead ends: 67 [2025-03-16 23:07:26,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 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 23:07:26,988 INFO L435 NwaCegarLoop]: 104 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, 104 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 23:07:26,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:07:26,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-16 23:07:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-16 23:07:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 23:07:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 104 transitions. [2025-03-16 23:07:27,014 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 104 transitions. Word has length 160 [2025-03-16 23:07:27,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:07:27,014 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 104 transitions. [2025-03-16 23:07:27,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-16 23:07:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 104 transitions. [2025-03-16 23:07:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-16 23:07:27,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:07:27,017 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:07:27,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 23:07:27,217 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 23:07:27,218 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:07:27,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:07:27,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1294949819, now seen corresponding path program 1 times [2025-03-16 23:07:27,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:07:27,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745305412] [2025-03-16 23:07:27,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:07:27,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:07:27,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-16 23:07:27,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-16 23:07:27,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:27,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:07:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-16 23:07:27,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:07:27,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745305412] [2025-03-16 23:07:27,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745305412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:07:27,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:07:27,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:07:27,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435018481] [2025-03-16 23:07:27,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:07:27,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:07:27,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:07:27,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:07:27,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:07:27,409 INFO L87 Difference]: Start difference. First operand 67 states and 104 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-16 23:07:27,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:07:27,467 INFO L93 Difference]: Finished difference Result 151 states and 235 transitions. [2025-03-16 23:07:27,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:07:27,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2025-03-16 23:07:27,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:07:27,469 INFO L225 Difference]: With dead ends: 151 [2025-03-16 23:07:27,469 INFO L226 Difference]: Without dead ends: 85 [2025-03-16 23:07:27,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:07:27,471 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 23 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:07:27,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 189 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:07:27,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-16 23:07:27,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2025-03-16 23:07:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 23:07:27,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 117 transitions. [2025-03-16 23:07:27,484 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 117 transitions. Word has length 160 [2025-03-16 23:07:27,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:07:27,485 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 117 transitions. [2025-03-16 23:07:27,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-16 23:07:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 117 transitions. [2025-03-16 23:07:27,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-16 23:07:27,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:07:27,487 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:07:27,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:07:27,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:07:27,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:07:27,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1098436314, now seen corresponding path program 1 times [2025-03-16 23:07:27,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:07:27,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743483043] [2025-03-16 23:07:27,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:07:27,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:07:27,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-16 23:07:27,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-16 23:07:27,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:27,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:07:27,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1322857756] [2025-03-16 23:07:27,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:07:27,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:07:27,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:07:27,657 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 23:07:27,658 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 23:07:27,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-16 23:07:27,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-16 23:07:27,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:27,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:07:27,764 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:07:27,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-16 23:07:27,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-16 23:07:27,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:27,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:07:27,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:07:27,861 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:07:27,862 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:07:27,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 23:07:28,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-16 23:07:28,067 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-16 23:07:28,129 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:07:28,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:07:28 BoogieIcfgContainer [2025-03-16 23:07:28,133 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:07:28,133 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:07:28,133 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:07:28,134 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:07:28,134 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:07:26" (3/4) ... [2025-03-16 23:07:28,135 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:07:28,136 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:07:28,136 INFO L158 Benchmark]: Toolchain (without parser) took 2412.68ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 74.7MB in the end (delta: 32.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2025-03-16 23:07:28,136 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:07:28,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.76ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 91.5MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:07:28,137 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.44ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:07:28,137 INFO L158 Benchmark]: Boogie Preprocessor took 49.07ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 85.2MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:07:28,137 INFO L158 Benchmark]: IcfgBuilder took 411.93ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 63.4MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:07:28,137 INFO L158 Benchmark]: TraceAbstraction took 1709.50ms. Allocated memory is still 142.6MB. Free memory was 63.4MB in the beginning and 74.9MB in the end (delta: -11.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:07:28,138 INFO L158 Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 74.7MB in the end (delta: 247.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:07:28,138 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.32ms. Allocated memory is still 201.3MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.76ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 91.5MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.44ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.07ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 85.2MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 411.93ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 63.4MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1709.50ms. Allocated memory is still 142.6MB. Free memory was 63.4MB in the beginning and 74.9MB in the end (delta: -11.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.61ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 74.7MB in the end (delta: 247.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 95. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.75; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 9.6; [L25] double var_1_4 = 7.625; [L26] double var_1_5 = 1.5; [L27] double var_1_6 = 63.17; [L28] double var_1_7 = 15.5; [L29] unsigned short int var_1_8 = 4; [L30] unsigned short int var_1_9 = 45624; [L31] unsigned short int var_1_10 = 39447; [L32] unsigned short int var_1_11 = 10; [L33] double var_1_12 = 255.5; [L34] double var_1_13 = 0.0; [L35] double var_1_14 = 127.5; [L36] float var_1_15 = 8.2; [L37] float var_1_16 = 2.8; [L38] signed short int var_1_17 = 8; [L39] double var_1_18 = 24.8; [L40] signed short int var_1_19 = -256; [L41] signed short int var_1_20 = 8; [L42] signed short int var_1_21 = 16; [L43] unsigned short int var_1_22 = 2; [L44] signed long int var_1_23 = -100; [L45] unsigned short int var_1_24 = 16; [L46] unsigned char var_1_25 = 0; [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] FCALL updateLastVariables() [L143] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_3=48/5, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_3=48/5, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L90] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_3=48/5, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L91] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_3=48/5, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_3=48/5, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L91] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_3=48/5, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L92] var_1_3 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L93] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_4=61/8, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L94] var_1_4 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L95] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_5=3/2, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L96] var_1_5 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L97] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_6=6317/100, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L98] var_1_6 = __VERIFIER_nondet_double() [L99] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L99] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_7=31/2, var_1_8=4, var_1_9=45624] [L100] var_1_7 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=45624] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=45624] [L101] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=45624] [L102] var_1_9 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_9 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L103] RET assume_abort_if_not(var_1_9 >= 32767) VAL [isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L104] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L104] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, var_1_10=39447, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L105] var_1_10 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L106] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, var_1_10=32767, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L107] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L107] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=32767, var_1_11=10, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L108] var_1_11 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L109] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32767, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L110] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L110] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_13=0, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L111] var_1_13 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L112] RET assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_18=124/5, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L113] var_1_18 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L114] RET assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L115] CALL assume_abort_if_not(var_1_18 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L115] RET assume_abort_if_not(var_1_18 != 0.0F) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=-256, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L116] var_1_19 = __VERIFIER_nondet_short() [L117] CALL assume_abort_if_not(var_1_19 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L117] RET assume_abort_if_not(var_1_19 >= -32767) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L118] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L118] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=8, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L119] var_1_20 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_20 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L120] RET assume_abort_if_not(var_1_20 >= -1) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L121] CALL assume_abort_if_not(var_1_20 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L121] RET assume_abort_if_not(var_1_20 <= 32766) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=16, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L122] var_1_21 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_21 >= -32766) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L123] RET assume_abort_if_not(var_1_21 >= -32766) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L124] CALL assume_abort_if_not(var_1_21 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L124] RET assume_abort_if_not(var_1_21 <= 32766) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-100, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L125] var_1_23 = __VERIFIER_nondet_long() [L126] CALL assume_abort_if_not(var_1_23 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L126] RET assume_abort_if_not(var_1_23 >= -2147483648) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L127] CALL assume_abort_if_not(var_1_23 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L127] RET assume_abort_if_not(var_1_23 <= 2147483647) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L128] var_1_25 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-2147483648, var_1_24=16, var_1_2=0, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-2147483648, var_1_24=16, var_1_2=0, var_1_8=4, var_1_9=32767] [L129] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-2147483648, var_1_24=16, var_1_2=0, var_1_8=4, var_1_9=32767] [L130] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L130] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L143] RET updateVariables() [L144] CALL step() [L50] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=4, var_1_9=32767] [L53] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=32767, var_1_9=32767] [L54] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=255/2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_8=32767, var_1_9=32767] [L57] var_1_14 = var_1_6 VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_6=2, var_1_8=32767, var_1_9=32767] [L58] COND FALSE !(var_1_13 >= var_1_14) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=2, var_1_15=41/5, var_1_16=14/5, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_6=2, var_1_8=32767, var_1_9=32767] [L65] COND TRUE var_1_3 <= var_1_4 [L66] var_1_16 = ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=2, var_1_15=41/5, var_1_16=2, var_1_17=8, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_4=0, var_1_6=2, var_1_8=32767, var_1_9=32767] [L68] COND FALSE !(var_1_7 >= (var_1_5 / ((((var_1_13) < (var_1_18)) ? (var_1_13) : (var_1_18))))) [L77] var_1_17 = var_1_21 VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=2, var_1_15=41/5, var_1_16=2, var_1_17=-32766, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=2, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_4=0, var_1_6=2, var_1_8=32767, var_1_9=32767] [L79] COND TRUE (var_1_11 + var_1_20) <= ((var_1_21 * var_1_23) * var_1_19) [L80] var_1_22 = (((((var_1_9 - var_1_11)) > (var_1_10)) ? ((var_1_9 - var_1_11)) : (var_1_10))) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=2, var_1_15=41/5, var_1_16=2, var_1_17=-32766, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=32767, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_4=0, var_1_6=2, var_1_8=32767, var_1_9=32767] [L82] COND FALSE !(var_1_9 < var_1_11) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=2, var_1_15=41/5, var_1_16=2, var_1_17=-32766, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=32767, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_4=0, var_1_6=2, var_1_8=32767, var_1_9=32767] [L144] RET step() [L145] CALL, EXPR property() [L135-L136] return ((((((((var_1_2 ? (var_1_1 == ((double) (((((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) < (var_1_7)) ? ((((((var_1_3 - var_1_4)) > (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))) ? ((var_1_3 - var_1_4)) : (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))))))) : (var_1_7))))) : 1) && (var_1_8 == ((unsigned short int) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11)))) && (var_1_2 ? (var_1_12 == ((double) (((((var_1_3 - (var_1_13 - 128.68))) < (var_1_7)) ? ((var_1_3 - (var_1_13 - 128.68))) : (var_1_7))))) : 1)) && (var_1_14 == ((double) var_1_6))) && ((var_1_13 >= var_1_14) ? (var_1_2 ? ((var_1_8 == var_1_11) ? (var_1_15 == ((float) 10.975f)) : 1) : 1) : 1)) && ((var_1_3 <= var_1_4) ? (var_1_16 == ((float) ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))))) : 1)) && ((var_1_7 >= (var_1_5 / ((((var_1_13) < (var_1_18)) ? (var_1_13) : (var_1_18))))) ? (((var_1_10 + var_1_9) <= var_1_11) ? (var_1_2 ? (var_1_17 == ((signed short int) var_1_19)) : 1) : (var_1_17 == ((signed short int) (var_1_20 - ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))))) : (var_1_17 == ((signed short int) var_1_21)))) && (((var_1_11 + var_1_20) <= ((var_1_21 * var_1_23) * var_1_19)) ? (var_1_22 == ((unsigned short int) (((((var_1_9 - var_1_11)) > (var_1_10)) ? ((var_1_9 - var_1_11)) : (var_1_10))))) : 1)) && ((var_1_9 < var_1_11) ? ((var_1_2 || var_1_25) ? (var_1_24 == ((unsigned short int) 128)) : 1) : 1) ; [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=2, var_1_15=41/5, var_1_16=2, var_1_17=-32766, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=32767, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_4=0, var_1_6=2, var_1_8=32767, var_1_9=32767] [L19] reach_error() VAL [isInitial=1, var_1_10=32767, var_1_11=65536, var_1_12=511/2, var_1_14=2, var_1_15=41/5, var_1_16=2, var_1_17=-32766, var_1_19=0, var_1_1=35/4, var_1_20=-1, var_1_21=-32766, var_1_22=32767, var_1_23=-2147483648, var_1_24=16, var_1_25=0, var_1_2=0, var_1_4=0, var_1_6=2, var_1_8=32767, var_1_9=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 134 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 293 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 203 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=2, InterpolantAutomatonStates: 5, 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, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 800 NumberOfCodeBlocks, 800 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 477 ConstructedInterpolants, 0 QuantifiedInterpolants, 485 SizeOfPredicates, 0 NumberOfNonLiveVariables, 361 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3850/3900 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 23:07:28,152 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_normal_file-36.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 1f5b5ff94f4836a99c81109f7a8f905db9934ea0167b4088f287cfdf0bb88b00 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:07:29,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:07:29,952 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:07:29,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:07:29,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:07:29,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:07:29,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:07:29,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:07:29,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:07:29,972 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:07:29,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:07:29,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:07:29,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:07:29,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:07:29,972 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:07:29,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:07:29,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:07:29,973 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:07:29,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:07:29,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:07:29,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:07:29,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:07:29,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:07:29,973 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:07:29,973 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:07:29,973 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:07:29,973 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:07:29,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:07:29,973 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:07:29,973 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:07:29,973 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:07:29,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:07:29,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:07:29,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:07:29,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:07:29,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:07:29,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:07:29,974 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:07:29,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:07:29,975 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:07:29,975 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:07:29,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:07:29,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:07:29,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:07:29,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:07:29,975 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 -> 1f5b5ff94f4836a99c81109f7a8f905db9934ea0167b4088f287cfdf0bb88b00 [2025-03-16 23:07:30,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:07:30,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:07:30,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:07:30,200 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:07:30,200 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:07:30,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-36.i [2025-03-16 23:07:31,321 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4cce93fa/835fa788f0464baeb49fe1cb3eea821f/FLAG20d92e891 [2025-03-16 23:07:31,503 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:07:31,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-36.i [2025-03-16 23:07:31,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4cce93fa/835fa788f0464baeb49fe1cb3eea821f/FLAG20d92e891 [2025-03-16 23:07:31,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4cce93fa/835fa788f0464baeb49fe1cb3eea821f [2025-03-16 23:07:31,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:07:31,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:07:31,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:07:31,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:07:31,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:07:31,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:07:31" (1/1) ... [2025-03-16 23:07:31,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28fad82d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:31, skipping insertion in model container [2025-03-16 23:07:31,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:07:31" (1/1) ... [2025-03-16 23:07:31,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:07:31,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-36.i[913,926] [2025-03-16 23:07:31,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:07:31,720 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:07:31,727 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-36.i[913,926] [2025-03-16 23:07:31,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:07:31,758 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:07:31,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:31 WrapperNode [2025-03-16 23:07:31,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:07:31,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:07:31,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:07:31,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:07:31,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:31" (1/1) ... [2025-03-16 23:07: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 11:07:31" (1/1) ... [2025-03-16 23:07:31,801 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2025-03-16 23:07:31,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:07:31,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:07:31,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:07:31,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:07:31,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:31" (1/1) ... [2025-03-16 23:07:31,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:31" (1/1) ... [2025-03-16 23:07:31,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:31" (1/1) ... [2025-03-16 23:07:31,827 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 23:07:31,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:31" (1/1) ... [2025-03-16 23:07:31,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:31" (1/1) ... [2025-03-16 23:07:31,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:31" (1/1) ... [2025-03-16 23:07:31,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:31" (1/1) ... [2025-03-16 23:07:31,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:31" (1/1) ... [2025-03-16 23:07:31,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:31" (1/1) ... [2025-03-16 23:07:31,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:07:31,854 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:07:31,854 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:07:31,854 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:07:31,855 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:31" (1/1) ... [2025-03-16 23:07:31,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:07:31,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:07:31,881 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 23:07:31,885 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 23:07:31,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:07:31,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:07:31,903 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:07:31,903 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:07:31,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:07:31,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:07:31,968 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:07:31,970 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:07:46,315 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 23:07:46,315 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:07:46,321 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:07:46,322 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:07:46,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:07:46 BoogieIcfgContainer [2025-03-16 23:07:46,322 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:07:46,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:07:46,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:07:46,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:07:46,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:07:31" (1/3) ... [2025-03-16 23:07:46,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c83f332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:07:46, skipping insertion in model container [2025-03-16 23:07:46,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:07:31" (2/3) ... [2025-03-16 23:07:46,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c83f332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:07:46, skipping insertion in model container [2025-03-16 23:07:46,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:07:46" (3/3) ... [2025-03-16 23:07:46,330 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-36.i [2025-03-16 23:07:46,340 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:07:46,341 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-36.i that has 2 procedures, 69 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:07:46,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:07:46,386 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;@77ecda00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:07:46,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:07:46,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 23:07:46,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-16 23:07:46,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:07:46,402 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:07:46,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:07:46,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:07:46,407 INFO L85 PathProgramCache]: Analyzing trace with hash 862724631, now seen corresponding path program 1 times [2025-03-16 23:07:46,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:07:46,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086631058] [2025-03-16 23:07:46,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:07:46,415 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 23:07:46,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:07:46,417 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 23:07:46,418 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 23:07:46,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-16 23:07:47,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-16 23:07:47,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:47,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:07:47,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:07:47,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:07:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-03-16 23:07:47,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:07:47,370 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:07:47,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086631058] [2025-03-16 23:07:47,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086631058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:07:47,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:07:47,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:07:47,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406830843] [2025-03-16 23:07:47,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:07:47,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:07:47,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:07:47,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:07:47,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:07:47,390 INFO L87 Difference]: Start difference. First operand has 69 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-16 23:07:47,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:07:47,413 INFO L93 Difference]: Finished difference Result 135 states and 240 transitions. [2025-03-16 23:07:47,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:07:47,415 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 160 [2025-03-16 23:07:47,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:07:47,419 INFO L225 Difference]: With dead ends: 135 [2025-03-16 23:07:47,419 INFO L226 Difference]: Without dead ends: 67 [2025-03-16 23:07:47,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 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 23:07:47,422 INFO L435 NwaCegarLoop]: 104 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, 104 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 23:07:47,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:07:47,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-16 23:07:47,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-16 23:07:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 23:07:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 104 transitions. [2025-03-16 23:07:47,447 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 104 transitions. Word has length 160 [2025-03-16 23:07:47,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:07:47,448 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 104 transitions. [2025-03-16 23:07:47,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-16 23:07:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 104 transitions. [2025-03-16 23:07:47,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-16 23:07:47,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:07:47,450 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:07:47,477 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 23:07:47,650 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 23:07:47,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:07:47,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:07:47,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1294949819, now seen corresponding path program 1 times [2025-03-16 23:07:47,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:07:47,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581230876] [2025-03-16 23:07:47,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:07:47,652 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 23:07:47,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:07:47,654 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 23:07:47,656 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 23:07:47,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-16 23:07:48,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-16 23:07:48,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:48,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:07:48,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 23:07:48,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:07:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-16 23:07:48,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:07:48,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:07:48,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581230876] [2025-03-16 23:07:48,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581230876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:07:48,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:07:48,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:07:48,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358806383] [2025-03-16 23:07:48,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:07:48,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:07:48,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:07:48,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:07:48,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:07:48,672 INFO L87 Difference]: Start difference. First operand 67 states and 104 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-16 23:07:54,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:07:58,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:07:58,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:07:58,491 INFO L93 Difference]: Finished difference Result 151 states and 235 transitions. [2025-03-16 23:07:58,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:07:58,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2025-03-16 23:07:58,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:07:58,493 INFO L225 Difference]: With dead ends: 151 [2025-03-16 23:07:58,493 INFO L226 Difference]: Without dead ends: 85 [2025-03-16 23:07:58,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:07:58,494 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 23 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2025-03-16 23:07:58,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 189 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2025-03-16 23:07:58,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-16 23:07:58,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2025-03-16 23:07:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 23:07:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 117 transitions. [2025-03-16 23:07:58,503 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 117 transitions. Word has length 160 [2025-03-16 23:07:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:07:58,503 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 117 transitions. [2025-03-16 23:07:58,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-16 23:07:58,504 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 117 transitions. [2025-03-16 23:07:58,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-16 23:07:58,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:07:58,505 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:07:58,531 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 23:07:58,705 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 23:07:58,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:07:58,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:07:58,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1098436314, now seen corresponding path program 1 times [2025-03-16 23:07:58,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:07:58,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758676236] [2025-03-16 23:07:58,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:07:58,707 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 23:07:58,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:07:58,710 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 23:07:58,711 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 23:07:58,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-16 23:07:59,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-16 23:07:59,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:07:59,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:07:59,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 23:07:59,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:08:54,396 WARN L286 SmtUtils]: Spent 8.73s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-16 23:09:02,929 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)