./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.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 58f9160d5aee9cc43b7c3e9a23be0e38f5b1f7b528eca50b07239bd3dfe5d081 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:55:47,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:55:47,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:55:47,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:55:47,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:55:47,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:55:47,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:55:47,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:55:47,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:55:47,938 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:55:47,939 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:55:47,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:55:47,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:55:47,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:55:47,939 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:55:47,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:55:47,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:55:47,940 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:55:47,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:55:47,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:55:47,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:55:47,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:55:47,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:55:47,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:55:47,940 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:55:47,940 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:55:47,941 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:55:47,941 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:55:47,941 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:55:47,941 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:55:47,941 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:55:47,941 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:55:47,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:55:47,941 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:55:47,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:55:47,942 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:55:47,942 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:55:47,942 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:55:47,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:55:47,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:55:47,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:55:47,942 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:55:47,942 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:55:47,942 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 -> 58f9160d5aee9cc43b7c3e9a23be0e38f5b1f7b528eca50b07239bd3dfe5d081 [2025-03-04 00:55:48,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:55:48,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:55:48,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:55:48,168 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:55:48,169 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:55:48,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i [2025-03-04 00:55:49,284 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3867571e8/46fccc0ea29747abaa40e152b114e014/FLAG7e6a91b19 [2025-03-04 00:55:49,502 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:55:49,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i [2025-03-04 00:55:49,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3867571e8/46fccc0ea29747abaa40e152b114e014/FLAG7e6a91b19 [2025-03-04 00:55:49,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3867571e8/46fccc0ea29747abaa40e152b114e014 [2025-03-04 00:55:49,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:55:49,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:55:49,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:55:49,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:55:49,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:55:49,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:55:49" (1/1) ... [2025-03-04 00:55:49,857 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2167b1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:49, skipping insertion in model container [2025-03-04 00:55:49,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:55:49" (1/1) ... [2025-03-04 00:55:49,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:55:49,957 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_variablewrapping_normal_file-52.i[913,926] [2025-03-04 00:55:49,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:55:49,989 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:55:49,995 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_variablewrapping_normal_file-52.i[913,926] [2025-03-04 00:55:50,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:55:50,025 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:55:50,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:50 WrapperNode [2025-03-04 00:55:50,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:55:50,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:55:50,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:55:50,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:55:50,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:50" (1/1) ... [2025-03-04 00:55:50,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:50" (1/1) ... [2025-03-04 00:55:50,064 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2025-03-04 00:55:50,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:55:50,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:55:50,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:55:50,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:55:50,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:50" (1/1) ... [2025-03-04 00:55:50,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:50" (1/1) ... [2025-03-04 00:55:50,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:50" (1/1) ... [2025-03-04 00:55:50,092 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-04 00:55:50,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:50" (1/1) ... [2025-03-04 00:55:50,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:50" (1/1) ... [2025-03-04 00:55:50,100 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:50" (1/1) ... [2025-03-04 00:55:50,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:50" (1/1) ... [2025-03-04 00:55:50,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:50" (1/1) ... [2025-03-04 00:55:50,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:50" (1/1) ... [2025-03-04 00:55:50,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:55:50,110 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:55:50,114 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:55:50,115 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:55:50,115 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:50" (1/1) ... [2025-03-04 00:55:50,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:55:50,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:55:50,147 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-04 00:55:50,149 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-04 00:55:50,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:55:50,167 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:55:50,168 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:55:50,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:55:50,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:55:50,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:55:50,223 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:55:50,225 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:55:50,432 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L98: havoc property_#t~ite17#1;havoc property_#t~bitwise16#1;havoc property_#t~short18#1; [2025-03-04 00:55:50,461 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-04 00:55:50,461 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:55:50,473 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:55:50,473 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:55:50,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:55:50 BoogieIcfgContainer [2025-03-04 00:55:50,474 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:55:50,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:55:50,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:55:50,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:55:50,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:55:49" (1/3) ... [2025-03-04 00:55:50,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c9a1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:55:50, skipping insertion in model container [2025-03-04 00:55:50,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:50" (2/3) ... [2025-03-04 00:55:50,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c9a1d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:55:50, skipping insertion in model container [2025-03-04 00:55:50,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:55:50" (3/3) ... [2025-03-04 00:55:50,481 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-52.i [2025-03-04 00:55:50,491 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:55:50,492 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-52.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:55:50,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:55:50,536 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;@6f9bb57d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:55:50,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:55:50,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 00:55:50,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 00:55:50,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:55:50,547 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:55:50,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:55:50,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:55:50,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1212575871, now seen corresponding path program 1 times [2025-03-04 00:55:50,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:55:50,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435510967] [2025-03-04 00:55:50,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:50,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:55:50,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 00:55:50,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 00:55:50,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:50,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:55:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 00:55:50,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:55:50,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435510967] [2025-03-04 00:55:50,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435510967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:55:50,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774546415] [2025-03-04 00:55:50,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:50,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:55:50,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:55:50,731 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-04 00:55:50,732 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-04 00:55:50,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 00:55:50,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 00:55:50,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:50,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:55:50,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:55:50,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:55:50,845 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-04 00:55:50,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:55:50,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774546415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:55:50,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:55:50,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:55:50,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110662749] [2025-03-04 00:55:50,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:55:50,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:55:50,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:55:50,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:55:50,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:55:50,867 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 00:55:50,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:55:50,888 INFO L93 Difference]: Finished difference Result 118 states and 195 transitions. [2025-03-04 00:55:50,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:55:50,890 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2025-03-04 00:55:50,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:55:50,893 INFO L225 Difference]: With dead ends: 118 [2025-03-04 00:55:50,893 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 00:55:50,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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-04 00:55:50,900 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:55:50,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:55:50,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 00:55:50,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-04 00:55:50,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 00:55:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2025-03-04 00:55:50,925 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 116 [2025-03-04 00:55:50,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:55:50,925 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2025-03-04 00:55:50,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 00:55:50,925 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2025-03-04 00:55:50,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 00:55:50,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:55:50,927 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:55:50,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:55:51,128 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-04 00:55:51,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:55:51,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:55:51,129 INFO L85 PathProgramCache]: Analyzing trace with hash -529127835, now seen corresponding path program 1 times [2025-03-04 00:55:51,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:55:51,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729491566] [2025-03-04 00:55:51,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:51,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:55:51,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 00:55:51,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 00:55:51,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:51,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:55:51,265 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:55:51,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 00:55:51,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 00:55:51,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:51,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:55:51,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:55:51,368 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:55:51,369 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:55:51,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:55:51,372 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:55:51,426 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:55:51,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:55:51 BoogieIcfgContainer [2025-03-04 00:55:51,428 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:55:51,429 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:55:51,429 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:55:51,429 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:55:51,429 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:55:50" (3/4) ... [2025-03-04 00:55:51,431 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:55:51,432 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:55:51,432 INFO L158 Benchmark]: Toolchain (without parser) took 1579.56ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 106.0MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2025-03-04 00:55:51,433 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:55:51,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.38ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 109.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:55:51,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.12ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:55:51,434 INFO L158 Benchmark]: Boogie Preprocessor took 44.96ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 105.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:55:51,434 INFO L158 Benchmark]: IcfgBuilder took 363.63ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 87.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:55:51,434 INFO L158 Benchmark]: TraceAbstraction took 952.69ms. Allocated memory is still 167.8MB. Free memory was 87.0MB in the beginning and 106.0MB in the end (delta: -19.1MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. [2025-03-04 00:55:51,435 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 106.0MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:55:51,436 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.14ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.38ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 109.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.12ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.96ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 105.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 363.63ms. Allocated memory is still 167.8MB. Free memory was 105.6MB in the beginning and 87.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 952.69ms. Allocated memory is still 167.8MB. Free memory was 87.0MB in the beginning and 106.0MB in the end (delta: -19.1MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 106.0MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] signed short int var_1_3 = 32; [L24] signed short int var_1_4 = -1; [L25] unsigned char var_1_5 = 1; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] double var_1_10 = 25.7; [L31] double var_1_11 = 256.5; [L32] double var_1_12 = 0.0; [L33] double var_1_13 = 31.1; [L34] double var_1_14 = 256.6; [L35] unsigned long int var_1_15 = 8; [L36] unsigned char var_1_16 = 16; VAL [isInitial=0, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=32, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] FCALL updateLastVariables() [L106] CALL updateVariables() [L65] var_1_3 = __VERIFIER_nondet_short() [L66] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L66] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L67] CALL assume_abort_if_not(var_1_3 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L67] RET assume_abort_if_not(var_1_3 <= 32766) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L68] var_1_4 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_4 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L69] RET assume_abort_if_not(var_1_4 >= -16383) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L70] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L70] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L71] var_1_6 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_7=0, var_1_8=1, var_1_9=0] [L72] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_7=0, var_1_8=1, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L73] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L74] var_1_7 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L75] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L76] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L77] var_1_8 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L78] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L79] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L79] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1] [L82] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=257/10, var_1_11=513/2, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L83] var_1_11 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L84] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_12=0, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L85] var_1_12 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L86] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_13=311/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L87] var_1_13 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L88] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_14=1283/5, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L89] var_1_14 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L90] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L91] var_1_16 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_15=8, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_15=8, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L92] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=257/10, var_1_15=8, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_16 <= 30) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=30, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=30, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not(var_1_16 <= 30) VAL [isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=30, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L106] RET updateVariables() [L107] CALL step() [L40] signed short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=2016, var_1_10=257/10, var_1_15=8, var_1_16=30, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L41] COND FALSE !(stepLocal_0 > ((var_1_4 / -256) * 32)) [L48] var_1_5 = var_1_9 VAL [isInitial=1, var_1_10=257/10, var_1_15=8, var_1_16=30, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L50] COND TRUE \read(var_1_7) [L51] var_1_10 = (var_1_11 - (((((var_1_12 - var_1_13)) > (var_1_14)) ? ((var_1_12 - var_1_13)) : (var_1_14)))) VAL [isInitial=1, var_1_15=8, var_1_16=30, var_1_1=-4, var_1_3=2016, var_1_4=-16128, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L53] COND TRUE var_1_10 < 63.75 [L54] var_1_1 = (10 - var_1_3) VAL [isInitial=1, var_1_15=8, var_1_16=30, var_1_1=-2006, var_1_3=2016, var_1_4=-16128, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L58] COND FALSE !(! (var_1_13 < (127.125 / var_1_12))) VAL [isInitial=1, var_1_15=8, var_1_16=30, var_1_1=-2006, var_1_3=2016, var_1_4=-16128, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR ((((var_1_10 < 63.75) ? (var_1_1 == ((signed short int) (10 - var_1_3))) : (var_1_1 == ((signed short int) (4 + var_1_4)))) && ((var_1_3 > ((var_1_4 / -256) * 32)) ? (var_1_6 ? (var_1_5 == ((unsigned char) (! (var_1_7 && var_1_8)))) : (var_1_5 == ((unsigned char) var_1_8))) : (var_1_5 == ((unsigned char) var_1_9)))) && (var_1_7 ? (var_1_10 == ((double) (var_1_11 - (((((var_1_12 - var_1_13)) > (var_1_14)) ? ((var_1_12 - var_1_13)) : (var_1_14)))))) : 1)) && ((! (var_1_13 < (127.125 / var_1_12))) ? ((var_1_1 <= ((var_1_4 * var_1_3) + (-2 << var_1_16))) ? (var_1_15 == ((unsigned long int) var_1_3)) : 1) : 1) VAL [isInitial=1, var_1_15=8, var_1_16=30, var_1_1=-2006, var_1_3=2016, var_1_4=-16128, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L98-L99] return ((((var_1_10 < 63.75) ? (var_1_1 == ((signed short int) (10 - var_1_3))) : (var_1_1 == ((signed short int) (4 + var_1_4)))) && ((var_1_3 > ((var_1_4 / -256) * 32)) ? (var_1_6 ? (var_1_5 == ((unsigned char) (! (var_1_7 && var_1_8)))) : (var_1_5 == ((unsigned char) var_1_8))) : (var_1_5 == ((unsigned char) var_1_9)))) && (var_1_7 ? (var_1_10 == ((double) (var_1_11 - (((((var_1_12 - var_1_13)) > (var_1_14)) ? ((var_1_12 - var_1_13)) : (var_1_14)))))) : 1)) && ((! (var_1_13 < (127.125 / var_1_12))) ? ((var_1_1 <= ((var_1_4 * var_1_3) + (-2 << var_1_16))) ? (var_1_15 == ((unsigned long int) var_1_3)) : 1) : 1) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_15=8, var_1_16=30, var_1_1=-2006, var_1_3=2016, var_1_4=-16128, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_15=8, var_1_16=30, var_1_1=-2006, var_1_3=2016, var_1_4=-16128, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 84 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 257 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1190/1224 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-04 00:55:51,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.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 58f9160d5aee9cc43b7c3e9a23be0e38f5b1f7b528eca50b07239bd3dfe5d081 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:55:53,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:55:53,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:55:53,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:55:53,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:55:53,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:55:53,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:55:53,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:55:53,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:55:53,342 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:55:53,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:55:53,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:55:53,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:55:53,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:55:53,343 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:55:53,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:55:53,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:55:53,343 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:55:53,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:55:53,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:55:53,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:55:53,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:55:53,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:55:53,343 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:55:53,343 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:55:53,344 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:55:53,344 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:55:53,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:55:53,344 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:55:53,344 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:55:53,344 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:55:53,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:55:53,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:55:53,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:55:53,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:55:53,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:55:53,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:55:53,345 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:55:53,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:55:53,345 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:55:53,345 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:55:53,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:55:53,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:55:53,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:55:53,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:55:53,345 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 -> 58f9160d5aee9cc43b7c3e9a23be0e38f5b1f7b528eca50b07239bd3dfe5d081 [2025-03-04 00:55:53,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:55:53,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:55:53,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:55:53,558 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:55:53,558 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:55:53,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i [2025-03-04 00:55:54,708 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a13b5b6c6/84d3232f25054dcea567658b6ed191e8/FLAG08779dd70 [2025-03-04 00:55:54,909 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:55:54,910 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-52.i [2025-03-04 00:55:54,918 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a13b5b6c6/84d3232f25054dcea567658b6ed191e8/FLAG08779dd70 [2025-03-04 00:55:55,278 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a13b5b6c6/84d3232f25054dcea567658b6ed191e8 [2025-03-04 00:55:55,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:55:55,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:55:55,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:55:55,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:55:55,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:55:55,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:55:55" (1/1) ... [2025-03-04 00:55:55,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c26aee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:55, skipping insertion in model container [2025-03-04 00:55:55,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:55:55" (1/1) ... [2025-03-04 00:55:55,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:55:55,411 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_variablewrapping_normal_file-52.i[913,926] [2025-03-04 00:55:55,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:55:55,458 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:55:55,466 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_variablewrapping_normal_file-52.i[913,926] [2025-03-04 00:55:55,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:55:55,494 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:55:55,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:55 WrapperNode [2025-03-04 00:55:55,496 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:55:55,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:55:55,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:55:55,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:55:55,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:55" (1/1) ... [2025-03-04 00:55:55,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:55" (1/1) ... [2025-03-04 00:55:55,538 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2025-03-04 00:55:55,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:55:55,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:55:55,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:55:55,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:55:55,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:55" (1/1) ... [2025-03-04 00:55:55,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:55" (1/1) ... [2025-03-04 00:55:55,554 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:55" (1/1) ... [2025-03-04 00:55:55,568 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-04 00:55:55,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:55" (1/1) ... [2025-03-04 00:55:55,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:55" (1/1) ... [2025-03-04 00:55:55,583 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:55" (1/1) ... [2025-03-04 00:55:55,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:55" (1/1) ... [2025-03-04 00:55:55,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:55" (1/1) ... [2025-03-04 00:55:55,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:55" (1/1) ... [2025-03-04 00:55:55,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:55:55,592 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:55:55,592 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:55:55,592 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:55:55,593 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:55" (1/1) ... [2025-03-04 00:55:55,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:55:55,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:55:55,621 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-04 00:55:55,625 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-04 00:55:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:55:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:55:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:55:55,646 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:55:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:55:55,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:55:55,708 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:55:55,711 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:56:08,656 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:56:08,656 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:56:08,662 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:56:08,662 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:56:08,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:56:08 BoogieIcfgContainer [2025-03-04 00:56:08,663 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:56:08,665 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:56:08,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:56:08,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:56:08,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:55:55" (1/3) ... [2025-03-04 00:56:08,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2945602a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:56:08, skipping insertion in model container [2025-03-04 00:56:08,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:55" (2/3) ... [2025-03-04 00:56:08,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2945602a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:56:08, skipping insertion in model container [2025-03-04 00:56:08,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:56:08" (3/3) ... [2025-03-04 00:56:08,669 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-52.i [2025-03-04 00:56:08,679 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:56:08,680 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-52.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:56:08,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:56:08,723 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;@50ebb21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:56:08,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:56:08,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 00:56:08,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 00:56:08,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:56:08,733 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:56:08,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:56:08,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:56:08,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1752185667, now seen corresponding path program 1 times [2025-03-04 00:56:08,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:56:08,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433468449] [2025-03-04 00:56:08,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:56:08,744 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-04 00:56:08,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:56:08,747 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-04 00:56:08,748 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-04 00:56:08,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 00:56:09,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 00:56:09,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:09,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:56:09,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:56:09,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:56:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-04 00:56:09,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:56:09,553 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:56:09,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433468449] [2025-03-04 00:56:09,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433468449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:56:09,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:56:09,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:56:09,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784656307] [2025-03-04 00:56:09,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:56:09,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:56:09,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:56:09,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:56:09,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:56:09,572 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 00:56:09,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:56:09,586 INFO L93 Difference]: Finished difference Result 100 states and 169 transitions. [2025-03-04 00:56:09,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:56:09,588 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2025-03-04 00:56:09,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:56:09,591 INFO L225 Difference]: With dead ends: 100 [2025-03-04 00:56:09,591 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 00:56:09,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-04 00:56:09,594 INFO L435 NwaCegarLoop]: 73 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, 73 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-04 00:56:09,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:56:09,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 00:56:09,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-04 00:56:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 00:56:09,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2025-03-04 00:56:09,625 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 114 [2025-03-04 00:56:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:56:09,626 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2025-03-04 00:56:09,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 00:56:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2025-03-04 00:56:09,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 00:56:09,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:56:09,628 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:56:09,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:56:09,829 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-04 00:56:09,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:56:09,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:56:09,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1670563033, now seen corresponding path program 1 times [2025-03-04 00:56:09,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:56:09,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849780876] [2025-03-04 00:56:09,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:56:09,830 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-04 00:56:09,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:56:09,833 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-04 00:56:09,834 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-04 00:56:09,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 00:56:10,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 00:56:10,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:10,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:56:10,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 00:56:10,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:56:53,650 WARN L286 SmtUtils]: Spent 17.19s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 00:57:03,303 WARN L286 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:57:22,535 WARN L286 SmtUtils]: Spent 5.89s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)