./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-20.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-20.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 7450394d9b42bbab28f41eb9cd320d1bfd5e5369ed04b7325d413479a72d2da0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:51:57,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:51:57,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:51:57,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:51:57,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:51:57,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:51:57,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:51:57,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:51:57,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:51:57,993 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:51:57,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:51:57,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:51:57,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:51:57,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:51:57,994 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:51:57,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:51:57,995 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:51:57,995 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:51:57,995 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:51:57,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:51:57,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:51:57,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:51:57,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:51:57,995 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:51:57,995 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:51:57,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:51:57,995 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:51:57,996 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:51:57,996 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:51:57,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:51:57,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:51:57,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:51:57,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:51:57,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:51:57,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:51:57,997 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:51:57,997 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:51:57,997 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:51:57,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:51:57,997 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:51:57,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:51:57,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:51:57,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:51:57,997 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 -> 7450394d9b42bbab28f41eb9cd320d1bfd5e5369ed04b7325d413479a72d2da0 [2025-03-04 00:51:58,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:51:58,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:51:58,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:51:58,259 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:51:58,259 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:51:58,261 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-20.i [2025-03-04 00:51:59,399 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/589ff1ad8/d0a52230565742d6aaaaa538d08a252f/FLAG32e7c6194 [2025-03-04 00:51:59,663 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:51:59,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-20.i [2025-03-04 00:51:59,674 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/589ff1ad8/d0a52230565742d6aaaaa538d08a252f/FLAG32e7c6194 [2025-03-04 00:51:59,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/589ff1ad8/d0a52230565742d6aaaaa538d08a252f [2025-03-04 00:51:59,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:51:59,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:51:59,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:51:59,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:51:59,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:51:59,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:51:59" (1/1) ... [2025-03-04 00:51:59,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a0d3c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:51:59, skipping insertion in model container [2025-03-04 00:51:59,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:51:59" (1/1) ... [2025-03-04 00:51:59,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:52:00,106 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-20.i[913,926] [2025-03-04 00:52:00,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:52:00,169 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:52:00,180 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-20.i[913,926] [2025-03-04 00:52:00,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:52:00,222 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:52:00,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:00 WrapperNode [2025-03-04 00:52:00,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:52:00,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:52:00,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:52:00,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:52:00,229 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:52:00" (1/1) ... [2025-03-04 00:52:00,240 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:52:00" (1/1) ... [2025-03-04 00:52:00,262 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-03-04 00:52:00,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:52:00,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:52:00,270 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:52:00,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:52:00,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:00" (1/1) ... [2025-03-04 00:52:00,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:00" (1/1) ... [2025-03-04 00:52:00,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:00" (1/1) ... [2025-03-04 00:52:00,295 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:52:00,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:00" (1/1) ... [2025-03-04 00:52:00,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:00" (1/1) ... [2025-03-04 00:52:00,301 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:00" (1/1) ... [2025-03-04 00:52:00,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:00" (1/1) ... [2025-03-04 00:52:00,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:00" (1/1) ... [2025-03-04 00:52:00,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:00" (1/1) ... [2025-03-04 00:52:00,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:52:00,313 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:52:00,313 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:52:00,313 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:52:00,314 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:00" (1/1) ... [2025-03-04 00:52:00,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:52:00,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:52:00,344 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:52:00,349 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:52:00,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:52:00,373 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:52:00,373 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:52:00,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:52:00,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:52:00,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:52:00,439 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:52:00,441 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:52:00,629 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-04 00:52:00,630 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:52:00,638 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:52:00,638 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:52:00,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:00 BoogieIcfgContainer [2025-03-04 00:52:00,638 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:52:00,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:52:00,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:52:00,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:52:00,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:51:59" (1/3) ... [2025-03-04 00:52:00,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c956332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:52:00, skipping insertion in model container [2025-03-04 00:52:00,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:00" (2/3) ... [2025-03-04 00:52:00,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c956332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:52:00, skipping insertion in model container [2025-03-04 00:52:00,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:00" (3/3) ... [2025-03-04 00:52:00,646 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-20.i [2025-03-04 00:52:00,659 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:52:00,661 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-20.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:52:00,711 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:52:00,721 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;@6deb6f44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:52:00,722 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:52:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 00:52:00,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 00:52:00,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:00,736 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:00,736 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:00,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:00,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1227006544, now seen corresponding path program 1 times [2025-03-04 00:52:00,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:52:00,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316066970] [2025-03-04 00:52:00,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:00,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:52:00,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 00:52:00,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 00:52:00,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:00,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 00:52:00,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:52:00,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316066970] [2025-03-04 00:52:00,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316066970] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:52:00,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34094936] [2025-03-04 00:52:00,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:00,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:52:00,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:52:00,923 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:52:00,925 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:52:00,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 00:52:01,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 00:52:01,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:01,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:01,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:52:01,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:52:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 00:52:01,083 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:52:01,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34094936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:52:01,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:52:01,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:52:01,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712290987] [2025-03-04 00:52:01,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:52:01,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:52:01,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:52:01,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:52:01,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:52:01,111 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 00:52:01,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:52:01,134 INFO L93 Difference]: Finished difference Result 106 states and 176 transitions. [2025-03-04 00:52:01,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:52:01,136 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 121 [2025-03-04 00:52:01,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:52:01,142 INFO L225 Difference]: With dead ends: 106 [2025-03-04 00:52:01,143 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 00:52:01,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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:52:01,148 INFO L435 NwaCegarLoop]: 76 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, 76 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:52:01,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:52:01,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 00:52:01,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-04 00:52:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 00:52:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2025-03-04 00:52:01,188 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 121 [2025-03-04 00:52:01,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:52:01,188 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2025-03-04 00:52:01,189 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 00:52:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2025-03-04 00:52:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 00:52:01,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:01,192 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:01,199 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:52:01,393 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:52:01,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:01,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:01,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1897817419, now seen corresponding path program 1 times [2025-03-04 00:52:01,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:52:01,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275563038] [2025-03-04 00:52:01,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:01,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:52:01,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 00:52:01,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 00:52:01,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:01,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:52:01,559 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:52:01,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 00:52:01,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 00:52:01,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:01,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:52:01,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:52:01,692 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:52:01,693 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:52:01,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:52:01,696 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:52:01,754 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:52:01,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:52:01 BoogieIcfgContainer [2025-03-04 00:52:01,762 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:52:01,763 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:52:01,763 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:52:01,763 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:52:01,764 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:00" (3/4) ... [2025-03-04 00:52:01,765 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:52:01,766 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:52:01,766 INFO L158 Benchmark]: Toolchain (without parser) took 1792.27ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 103.7MB in the end (delta: 20.7MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2025-03-04 00:52:01,767 INFO L158 Benchmark]: CDTParser took 0.66ms. 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:52:01,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.66ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 111.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:52:01,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.59ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 109.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:52:01,768 INFO L158 Benchmark]: Boogie Preprocessor took 44.92ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 107.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:52:01,769 INFO L158 Benchmark]: IcfgBuilder took 325.29ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 90.0MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:52:01,770 INFO L158 Benchmark]: TraceAbstraction took 1121.99ms. Allocated memory is still 167.8MB. Free memory was 89.3MB in the beginning and 103.8MB in the end (delta: -14.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:52:01,770 INFO L158 Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 167.8MB. Free memory was 103.8MB in the beginning and 103.7MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:52:01,771 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.66ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.66ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 111.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.59ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 109.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.92ms. Allocated memory is still 167.8MB. Free memory was 109.7MB in the beginning and 107.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 325.29ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 90.0MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1121.99ms. Allocated memory is still 167.8MB. Free memory was 89.3MB in the beginning and 103.8MB in the end (delta: -14.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.13ms. Allocated memory is still 167.8MB. Free memory was 103.8MB in the beginning and 103.7MB 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 46, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryArithmeticFLOAToperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.6; [L23] unsigned char var_1_2 = 0; [L24] float var_1_3 = 0.0; [L25] float var_1_4 = 2.95; [L26] float var_1_5 = 8.5; [L27] float var_1_6 = 999999999999.4; [L28] double var_1_7 = 10.2; [L29] double var_1_8 = 4.6; [L30] unsigned long int var_1_9 = 256; [L31] unsigned char var_1_10 = 0; [L32] unsigned long int var_1_11 = 3724367395; [L33] unsigned long int var_1_12 = 25; [L34] unsigned long int var_1_13 = 1; [L35] unsigned char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 100; VAL [isInitial=0, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L70] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L70] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L71] var_1_3 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L72] RET assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L73] var_1_4 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L74] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L75] var_1_5 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L76] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L77] var_1_6 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L78] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L79] var_1_8 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L80] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L81] var_1_10 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L82] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L83] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L83] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L84] var_1_11 = __VERIFIER_nondet_ulong() [L85] CALL assume_abort_if_not(var_1_11 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L85] RET assume_abort_if_not(var_1_11 >= 3221225470) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L86] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L86] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L87] var_1_12 = __VERIFIER_nondet_ulong() [L88] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L88] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L89] CALL assume_abort_if_not(var_1_12 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L89] RET assume_abort_if_not(var_1_12 <= 1073741823) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L90] var_1_13 = __VERIFIER_nondet_ulong() [L91] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L91] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L92] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L92] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L93] var_1_15 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L94] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L95] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L95] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L96] var_1_16 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L97] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L98] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L98] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L111] RET updateVariables() [L112] CALL step() [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((var_1_3 - var_1_4) - var_1_5) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L46] var_1_7 = ((15.5 + var_1_4) - (var_1_3 - var_1_8)) [L47] unsigned long int stepLocal_2 = var_1_13; [L48] signed long int stepLocal_1 = 5; VAL [isInitial=1, stepLocal_1=5, stepLocal_2=-2147483649, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=256] [L49] COND FALSE !(stepLocal_1 >= var_1_11) VAL [isInitial=1, stepLocal_2=-2147483649, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=256] [L60] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=-255, stepLocal_2=-2147483649, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=256] [L61] COND TRUE var_1_10 || stepLocal_0 [L62] var_1_9 = ((var_1_11 - var_1_14) - var_1_14) VAL [isInitial=1, stepLocal_2=-2147483649, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=3221225468] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return (((var_1_2 ? (var_1_1 == ((float) ((var_1_3 - var_1_4) - var_1_5))) : (var_1_1 == ((float) (var_1_4 + var_1_6)))) && (var_1_7 == ((double) ((15.5 + var_1_4) - (var_1_3 - var_1_8))))) && ((var_1_10 || var_1_2) ? (var_1_9 == ((unsigned long int) ((var_1_11 - var_1_14) - var_1_14))) : (var_1_9 == ((unsigned long int) (var_1_14 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))))) && ((5 >= var_1_11) ? ((var_1_1 >= var_1_8) ? (var_1_14 == ((unsigned char) (128 - 16))) : ((var_1_13 >= ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) ? (var_1_14 == ((unsigned char) (var_1_15 - var_1_16))) : (var_1_14 == ((unsigned char) var_1_16)))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=3221225468] [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=3221225468] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=3221225470, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=3221225468] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 76 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred 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, 363 NumberOfCodeBlocks, 363 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 267 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1332/1368 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:52:01,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-20.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 7450394d9b42bbab28f41eb9cd320d1bfd5e5369ed04b7325d413479a72d2da0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:52:03,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:52:03,703 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:52:03,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:52:03,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:52:03,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:52:03,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:52:03,733 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:52:03,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:52:03,733 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:52:03,734 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:52:03,734 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:52:03,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:52:03,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:52:03,735 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:52:03,735 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:52:03,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:52:03,735 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:52:03,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:52:03,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:52:03,735 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:52:03,735 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:52:03,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:52:03,736 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:52:03,736 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:52:03,736 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:52:03,736 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:52:03,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:52:03,736 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:52:03,736 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:52:03,736 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:52:03,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:52:03,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:52:03,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:52:03,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:52:03,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:52:03,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:52:03,737 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:52:03,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:52:03,737 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:52:03,737 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:52:03,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:52:03,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:52:03,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:52:03,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:52:03,738 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 -> 7450394d9b42bbab28f41eb9cd320d1bfd5e5369ed04b7325d413479a72d2da0 [2025-03-04 00:52:04,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:52:04,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:52:04,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:52:04,011 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:52:04,011 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:52:04,012 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-20.i [2025-03-04 00:52:05,202 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/497ebf4cd/f1781dcc58a544a9816b1c1e1b640f7e/FLAG9c7722ef2 [2025-03-04 00:52:05,401 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:52:05,402 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-20.i [2025-03-04 00:52:05,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/497ebf4cd/f1781dcc58a544a9816b1c1e1b640f7e/FLAG9c7722ef2 [2025-03-04 00:52:05,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/497ebf4cd/f1781dcc58a544a9816b1c1e1b640f7e [2025-03-04 00:52:05,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:52:05,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:52:05,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:52:05,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:52:05,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:52:05,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:52:05" (1/1) ... [2025-03-04 00:52:05,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799fe5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:05, skipping insertion in model container [2025-03-04 00:52:05,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:52:05" (1/1) ... [2025-03-04 00:52:05,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:52:05,560 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-20.i[913,926] [2025-03-04 00:52:05,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:52:05,615 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:52:05,623 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-20.i[913,926] [2025-03-04 00:52:05,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:52:05,668 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:52:05,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:05 WrapperNode [2025-03-04 00:52:05,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:52:05,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:52:05,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:52:05,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:52:05,677 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:52:05" (1/1) ... [2025-03-04 00:52:05,686 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:52:05" (1/1) ... [2025-03-04 00:52:05,710 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-03-04 00:52:05,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:52:05,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:52:05,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:52:05,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:52:05,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:05" (1/1) ... [2025-03-04 00:52:05,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:05" (1/1) ... [2025-03-04 00:52:05,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:05" (1/1) ... [2025-03-04 00:52:05,739 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:52:05,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:05" (1/1) ... [2025-03-04 00:52:05,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:05" (1/1) ... [2025-03-04 00:52:05,750 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:05" (1/1) ... [2025-03-04 00:52:05,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:05" (1/1) ... [2025-03-04 00:52:05,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:05" (1/1) ... [2025-03-04 00:52:05,758 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:05" (1/1) ... [2025-03-04 00:52:05,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:52:05,764 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:52:05,764 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:52:05,765 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:52:05,766 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:05" (1/1) ... [2025-03-04 00:52:05,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:52:05,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:52:05,799 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:52:05,803 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:52:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:52:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:52:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:52:05,822 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:52:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:52:05,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:52:05,884 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:52:05,886 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:52:14,299 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-04 00:52:14,299 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:52:14,308 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:52:14,308 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:52:14,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:14 BoogieIcfgContainer [2025-03-04 00:52:14,308 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:52:14,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:52:14,310 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:52:14,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:52:14,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:52:05" (1/3) ... [2025-03-04 00:52:14,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610d7dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:52:14, skipping insertion in model container [2025-03-04 00:52:14,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:52:05" (2/3) ... [2025-03-04 00:52:14,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610d7dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:52:14, skipping insertion in model container [2025-03-04 00:52:14,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:52:14" (3/3) ... [2025-03-04 00:52:14,315 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-20.i [2025-03-04 00:52:14,324 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:52:14,325 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-20.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:52:14,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:52:14,369 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;@e29c89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:52:14,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:52:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 00:52:14,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 00:52:14,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:14,379 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:14,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:14,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:14,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1227006544, now seen corresponding path program 1 times [2025-03-04 00:52:14,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:52:14,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863468369] [2025-03-04 00:52:14,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:14,390 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:52:14,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:52:14,393 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:52:14,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:52:14,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 00:52:14,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 00:52:14,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:14,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:14,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:52:14,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:52:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2025-03-04 00:52:14,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:52:14,791 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:52:14,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863468369] [2025-03-04 00:52:14,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863468369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:52:14,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:52:14,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:52:14,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637856735] [2025-03-04 00:52:14,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:52:14,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:52:14,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:52:14,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:52:14,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:52:14,828 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 00:52:14,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:52:14,842 INFO L93 Difference]: Finished difference Result 106 states and 176 transitions. [2025-03-04 00:52:14,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:52:14,843 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 121 [2025-03-04 00:52:14,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:52:14,848 INFO L225 Difference]: With dead ends: 106 [2025-03-04 00:52:14,848 INFO L226 Difference]: Without dead ends: 53 [2025-03-04 00:52:14,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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:52:14,853 INFO L435 NwaCegarLoop]: 76 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, 76 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:52:14,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:52:14,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-04 00:52:14,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-04 00:52:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 00:52:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2025-03-04 00:52:14,891 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 121 [2025-03-04 00:52:14,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:52:14,891 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2025-03-04 00:52:14,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 00:52:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2025-03-04 00:52:14,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 00:52:14,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:52:14,893 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:14,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:52:15,094 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:52:15,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:52:15,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:52:15,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1897817419, now seen corresponding path program 1 times [2025-03-04 00:52:15,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:52:15,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766502827] [2025-03-04 00:52:15,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:52:15,096 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:52:15,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:52:15,099 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:52:15,100 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:52:15,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 00:52:15,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 00:52:15,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:52:15,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:52:15,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 00:52:15,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:52:45,551 WARN L286 SmtUtils]: Spent 8.17s 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) [2025-03-04 00:52:53,681 WARN L286 SmtUtils]: Spent 8.13s 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) [2025-03-04 00:53:01,810 WARN L286 SmtUtils]: Spent 8.13s 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) [2025-03-04 00:53:09,939 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:53:18,089 WARN L286 SmtUtils]: Spent 8.15s 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:53:26,219 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:53:34,371 WARN L286 SmtUtils]: Spent 8.15s 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) [2025-03-04 00:53:42,500 WARN L286 SmtUtils]: Spent 8.13s 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)