./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1232a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/float-newlib/float_req_bl_1232a.c -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 6f83584f969f73b8fbd0ee35f3e06725eeb8b2fb54d0ca8487878342f741f280 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 03:14:22,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 03:14:22,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 03:14:22,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 03:14:22,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 03:14:22,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 03:14:22,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 03:14:22,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 03:14:22,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 03:14:22,242 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 03:14:22,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 03:14:22,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 03:14:22,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 03:14:22,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 03:14:22,243 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 03:14:22,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 03:14:22,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 03:14:22,244 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 03:14:22,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 03:14:22,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 03:14:22,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 03:14:22,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 03:14:22,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 03:14:22,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 03:14:22,244 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 03:14:22,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 03:14:22,245 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 03:14:22,245 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 03:14:22,245 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 03:14:22,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 03:14:22,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 03:14:22,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 03:14:22,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 03:14:22,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 03:14:22,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 03:14:22,245 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 03:14:22,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 03:14:22,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 03:14:22,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 03:14:22,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 03:14:22,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 03:14:22,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 03:14:22,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 03:14:22,245 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 -> 6f83584f969f73b8fbd0ee35f3e06725eeb8b2fb54d0ca8487878342f741f280 [2025-03-08 03:14:22,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 03:14:22,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 03:14:22,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 03:14:22,492 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 03:14:22,492 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 03:14:22,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2025-03-08 03:14:23,627 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7eba6a42/82214930b90d4b93bd84d02b479736bc/FLAG798620b3f [2025-03-08 03:14:23,829 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 03:14:23,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2025-03-08 03:14:23,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7eba6a42/82214930b90d4b93bd84d02b479736bc/FLAG798620b3f [2025-03-08 03:14:23,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7eba6a42/82214930b90d4b93bd84d02b479736bc [2025-03-08 03:14:23,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 03:14:23,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 03:14:23,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 03:14:23,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 03:14:23,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 03:14:23,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:14:23" (1/1) ... [2025-03-08 03:14:23,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67e62c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:23, skipping insertion in model container [2025-03-08 03:14:23,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:14:23" (1/1) ... [2025-03-08 03:14:23,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 03:14:24,036 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/float-newlib/float_req_bl_1232a.c[1656,1669] [2025-03-08 03:14:24,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 03:14:24,048 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 03:14:24,067 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/float-newlib/float_req_bl_1232a.c[1656,1669] [2025-03-08 03:14:24,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 03:14:24,083 INFO L204 MainTranslator]: Completed translation [2025-03-08 03:14:24,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:24 WrapperNode [2025-03-08 03:14:24,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 03:14:24,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 03:14:24,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 03:14:24,086 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 03:14:24,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:24" (1/1) ... [2025-03-08 03:14:24,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:24" (1/1) ... [2025-03-08 03:14:24,109 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2025-03-08 03:14:24,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 03:14:24,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 03:14:24,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 03:14:24,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 03:14:24,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:24" (1/1) ... [2025-03-08 03:14:24,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:24" (1/1) ... [2025-03-08 03:14:24,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:24" (1/1) ... [2025-03-08 03:14:24,138 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-08 03:14:24,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:24" (1/1) ... [2025-03-08 03:14:24,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:24" (1/1) ... [2025-03-08 03:14:24,146 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:24" (1/1) ... [2025-03-08 03:14:24,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:24" (1/1) ... [2025-03-08 03:14:24,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:24" (1/1) ... [2025-03-08 03:14:24,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:24" (1/1) ... [2025-03-08 03:14:24,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 03:14:24,156 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 03:14:24,157 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 03:14:24,157 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 03:14:24,157 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:24" (1/1) ... [2025-03-08 03:14:24,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 03:14:24,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 03:14:24,185 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-08 03:14:24,189 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-08 03:14:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 03:14:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 03:14:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 03:14:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 03:14:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 03:14:24,206 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2025-03-08 03:14:24,206 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2025-03-08 03:14:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-08 03:14:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-08 03:14:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-08 03:14:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 03:14:24,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 03:14:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 03:14:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 03:14:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 03:14:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 03:14:24,262 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 03:14:24,263 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 03:14:24,413 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-08 03:14:24,414 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 03:14:24,420 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 03:14:24,421 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 03:14:24,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:14:24 BoogieIcfgContainer [2025-03-08 03:14:24,421 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 03:14:24,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 03:14:24,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 03:14:24,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 03:14:24,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:14:23" (1/3) ... [2025-03-08 03:14:24,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d31b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:14:24, skipping insertion in model container [2025-03-08 03:14:24,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:24" (2/3) ... [2025-03-08 03:14:24,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d31b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:14:24, skipping insertion in model container [2025-03-08 03:14:24,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:14:24" (3/3) ... [2025-03-08 03:14:24,428 INFO L128 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232a.c [2025-03-08 03:14:24,438 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 03:14:24,440 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG float_req_bl_1232a.c that has 2 procedures, 31 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-03-08 03:14:24,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 03:14:24,485 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;@22fea282, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 03:14:24,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-08 03:14:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 27 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 03:14:24,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 03:14:24,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:14:24,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 03:14:24,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __fpclassify_floatErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [__fpclassify_floatErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-08 03:14:24,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:14:24,497 INFO L85 PathProgramCache]: Analyzing trace with hash 77271573, now seen corresponding path program 1 times [2025-03-08 03:14:24,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 03:14:24,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466669266] [2025-03-08 03:14:24,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:14:24,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 03:14:24,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 03:14:24,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 03:14:24,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:14:24,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 03:14:24,580 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 03:14:24,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 03:14:24,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 03:14:24,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:14:24,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 03:14:24,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 03:14:24,612 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 03:14:24,613 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __fpclassify_floatErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (2 of 3 remaining) [2025-03-08 03:14:24,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-08 03:14:24,615 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE (0 of 3 remaining) [2025-03-08 03:14:24,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 03:14:24,619 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-08 03:14:24,631 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 03:14:24,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:14:24 BoogieIcfgContainer [2025-03-08 03:14:24,636 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 03:14:24,637 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 03:14:24,637 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 03:14:24,637 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 03:14:24,638 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:14:24" (3/4) ... [2025-03-08 03:14:24,640 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 03:14:24,640 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 03:14:24,642 INFO L158 Benchmark]: Toolchain (without parser) took 757.78ms. Allocated memory is still 142.6MB. Free memory was 115.3MB in the beginning and 75.5MB in the end (delta: 39.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 03:14:24,642 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:14:24,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.97ms. Allocated memory is still 142.6MB. Free memory was 115.3MB in the beginning and 104.0MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 03:14:24,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.95ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 102.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:14:24,643 INFO L158 Benchmark]: Boogie Preprocessor took 44.81ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 101.7MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 03:14:24,644 INFO L158 Benchmark]: IcfgBuilder took 264.61ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 88.2MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 03:14:24,645 INFO L158 Benchmark]: TraceAbstraction took 213.71ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 75.5MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 03:14:24,645 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 142.6MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:14:24,646 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.28ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.97ms. Allocated memory is still 142.6MB. Free memory was 115.3MB in the beginning and 104.0MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.95ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 102.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.81ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 101.7MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 264.61ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 88.2MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 213.71ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 75.5MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 142.6MB. Free memory is still 75.5MB. 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: 18]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of union with floats in the HoenickeLindenmann_Original memory model at line 18, overapproximation of someUnaryFLOAToperation at line 67. Possible FailurePath: [L66] float x = 0.0f; [L67] float y = -0.0f; [L68] CALL fmin_float(x, y) [L38] CALL __fpclassify_float(x) VAL [\old(x)=0] [L15] __uint32_t w; VAL [\old(x)=0] [L18] ieee_float_shape_type gf_u; VAL [\old(x)=0] - UnprovableResult [Line: 72]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 47 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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-08 03:14:24,662 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/float-newlib/float_req_bl_1232a.c -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 6f83584f969f73b8fbd0ee35f3e06725eeb8b2fb54d0ca8487878342f741f280 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 03:14:26,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 03:14:26,638 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 03:14:26,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 03:14:26,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 03:14:26,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 03:14:26,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 03:14:26,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 03:14:26,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 03:14:26,674 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 03:14:26,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 03:14:26,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 03:14:26,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 03:14:26,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 03:14:26,674 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 03:14:26,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 03:14:26,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 03:14:26,675 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 03:14:26,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 03:14:26,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 03:14:26,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 03:14:26,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 03:14:26,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 03:14:26,676 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 03:14:26,676 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 03:14:26,676 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 03:14:26,676 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 03:14:26,676 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 03:14:26,677 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 03:14:26,677 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 03:14:26,677 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 03:14:26,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 03:14:26,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 03:14:26,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 03:14:26,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 03:14:26,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 03:14:26,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 03:14:26,678 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 03:14:26,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 03:14:26,678 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 03:14:26,678 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 03:14:26,678 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 03:14:26,678 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 03:14:26,678 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 03:14:26,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 03:14:26,678 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 -> 6f83584f969f73b8fbd0ee35f3e06725eeb8b2fb54d0ca8487878342f741f280 [2025-03-08 03:14:26,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 03:14:26,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 03:14:26,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 03:14:26,918 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 03:14:26,918 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 03:14:26,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2025-03-08 03:14:28,132 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8f8b30ac/32786c0baff14872ad0d571629ee5054/FLAG85e922eb1 [2025-03-08 03:14:28,279 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 03:14:28,279 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2025-03-08 03:14:28,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8f8b30ac/32786c0baff14872ad0d571629ee5054/FLAG85e922eb1 [2025-03-08 03:14:28,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8f8b30ac/32786c0baff14872ad0d571629ee5054 [2025-03-08 03:14:28,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 03:14:28,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 03:14:28,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 03:14:28,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 03:14:28,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 03:14:28,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:14:28" (1/1) ... [2025-03-08 03:14:28,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5be9ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:28, skipping insertion in model container [2025-03-08 03:14:28,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:14:28" (1/1) ... [2025-03-08 03:14:28,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 03:14:28,822 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c[1656,1669] [2025-03-08 03:14:28,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 03:14:28,839 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 03:14:28,858 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/float-newlib/float_req_bl_1232a.c[1656,1669] [2025-03-08 03:14:28,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 03:14:28,876 INFO L204 MainTranslator]: Completed translation [2025-03-08 03:14:28,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:28 WrapperNode [2025-03-08 03:14:28,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 03:14:28,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 03:14:28,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 03:14:28,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 03:14:28,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:28" (1/1) ... [2025-03-08 03:14:28,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:28" (1/1) ... [2025-03-08 03:14:28,908 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2025-03-08 03:14:28,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 03:14:28,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 03:14:28,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 03:14:28,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 03:14:28,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:28" (1/1) ... [2025-03-08 03:14:28,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:28" (1/1) ... [2025-03-08 03:14:28,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:28" (1/1) ... [2025-03-08 03:14:28,930 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-08 03:14:28,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:28" (1/1) ... [2025-03-08 03:14:28,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:28" (1/1) ... [2025-03-08 03:14:28,938 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:28" (1/1) ... [2025-03-08 03:14:28,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:28" (1/1) ... [2025-03-08 03:14:28,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:28" (1/1) ... [2025-03-08 03:14:28,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:28" (1/1) ... [2025-03-08 03:14:28,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 03:14:28,944 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 03:14:28,944 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 03:14:28,944 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 03:14:28,945 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:28" (1/1) ... [2025-03-08 03:14:28,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 03:14:28,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 03:14:28,977 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-08 03:14:28,984 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-08 03:14:29,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 03:14:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 03:14:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 03:14:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 03:14:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 03:14:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2025-03-08 03:14:29,004 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2025-03-08 03:14:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 03:14:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 03:14:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-08 03:14:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 03:14:29,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 03:14:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-08 03:14:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-08 03:14:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-08 03:14:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 03:14:29,072 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 03:14:29,074 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 03:14:29,229 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-08 03:14:29,229 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 03:14:29,236 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 03:14:29,236 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 03:14:29,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:14:29 BoogieIcfgContainer [2025-03-08 03:14:29,236 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 03:14:29,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 03:14:29,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 03:14:29,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 03:14:29,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:14:28" (1/3) ... [2025-03-08 03:14:29,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a49b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:14:29, skipping insertion in model container [2025-03-08 03:14:29,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:14:28" (2/3) ... [2025-03-08 03:14:29,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a49b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:14:29, skipping insertion in model container [2025-03-08 03:14:29,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:14:29" (3/3) ... [2025-03-08 03:14:29,244 INFO L128 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232a.c [2025-03-08 03:14:29,254 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 03:14:29,255 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG float_req_bl_1232a.c that has 2 procedures, 27 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 03:14:29,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 03:14:29,300 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;@21923d6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 03:14:29,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 03:14:29,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 03:14:29,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 03:14:29,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:14:29,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:14:29,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:14:29,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:14:29,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2062203858, now seen corresponding path program 1 times [2025-03-08 03:14:29,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:14:29,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349736581] [2025-03-08 03:14:29,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:14:29,320 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-08 03:14:29,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:14:29,323 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-08 03:14:29,324 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-08 03:14:29,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 03:14:29,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 03:14:29,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:14:29,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:14:29,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 03:14:29,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:14:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 03:14:29,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:14:29,402 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:14:29,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349736581] [2025-03-08 03:14:29,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349736581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:14:29,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:14:29,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 03:14:29,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851343708] [2025-03-08 03:14:29,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:14:29,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 03:14:29,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:14:29,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 03:14:29,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 03:14:29,430 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 03:14:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:14:29,443 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2025-03-08 03:14:29,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 03:14:29,444 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-08 03:14:29,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:14:29,448 INFO L225 Difference]: With dead ends: 51 [2025-03-08 03:14:29,449 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 03:14:29,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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-08 03:14:29,454 INFO L435 NwaCegarLoop]: 34 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, 34 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-08 03:14:29,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 03:14:29,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 03:14:29,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-08 03:14:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 03:14:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-03-08 03:14:29,479 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2025-03-08 03:14:29,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:14:29,479 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-03-08 03:14:29,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 03:14:29,480 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-03-08 03:14:29,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 03:14:29,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:14:29,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:14:29,488 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-08 03:14:29,684 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-08 03:14:29,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:14:29,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:14:29,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1219521436, now seen corresponding path program 1 times [2025-03-08 03:14:29,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:14:29,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564830481] [2025-03-08 03:14:29,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:14:29,685 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-08 03:14:29,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:14:29,688 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-08 03:14:29,689 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-08 03:14:29,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 03:14:29,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 03:14:29,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:14:29,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:14:29,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 03:14:29,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:14:29,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 03:14:29,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:14:29,772 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:14:29,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564830481] [2025-03-08 03:14:29,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564830481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:14:29,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:14:29,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 03:14:29,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656502289] [2025-03-08 03:14:29,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:14:29,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 03:14:29,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:14:29,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 03:14:29,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:14:29,773 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 03:14:29,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:14:29,793 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2025-03-08 03:14:29,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 03:14:29,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-08 03:14:29,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:14:29,795 INFO L225 Difference]: With dead ends: 36 [2025-03-08 03:14:29,795 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 03:14:29,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:14:29,796 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 03:14:29,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 03:14:29,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 03:14:29,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-08 03:14:29,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 03:14:29,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-03-08 03:14:29,804 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2025-03-08 03:14:29,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:14:29,805 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-08 03:14:29,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 03:14:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-03-08 03:14:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 03:14:29,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:14:29,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:14:29,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-08 03:14:30,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 03:14:30,008 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:14:30,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:14:30,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1732408590, now seen corresponding path program 1 times [2025-03-08 03:14:30,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:14:30,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94802902] [2025-03-08 03:14:30,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:14:30,010 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-08 03:14:30,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:14:30,012 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 03:14:30,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 03:14:30,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 03:14:30,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 03:14:30,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:14:30,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:14:30,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 03:14:30,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:14:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 03:14:30,198 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:14:30,198 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:14:30,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94802902] [2025-03-08 03:14:30,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94802902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:14:30,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:14:30,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 03:14:30,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631666954] [2025-03-08 03:14:30,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:14:30,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 03:14:30,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:14:30,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 03:14:30,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 03:14:30,200 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 03:14:30,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:14:30,386 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2025-03-08 03:14:30,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 03:14:30,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-08 03:14:30,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:14:30,387 INFO L225 Difference]: With dead ends: 49 [2025-03-08 03:14:30,387 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 03:14:30,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 03:14:30,388 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 03:14:30,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 73 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 03:14:30,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 03:14:30,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-08 03:14:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 03:14:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-03-08 03:14:30,391 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2025-03-08 03:14:30,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:14:30,391 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-03-08 03:14:30,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 03:14:30,391 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-03-08 03:14:30,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 03:14:30,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:14:30,392 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:14:30,399 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 (4)] Ended with exit code 0 [2025-03-08 03:14:30,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-08 03:14:30,595 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:14:30,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:14:30,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1881886182, now seen corresponding path program 1 times [2025-03-08 03:14:30,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:14:30,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096842912] [2025-03-08 03:14:30,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:14:30,596 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-08 03:14:30,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:14:30,598 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 03:14:30,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 03:14:30,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 03:14:30,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 03:14:30,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:14:30,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:14:30,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 03:14:30,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:14:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 03:14:30,659 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:14:30,659 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:14:30,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096842912] [2025-03-08 03:14:30,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096842912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:14:30,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:14:30,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 03:14:30,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256345509] [2025-03-08 03:14:30,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:14:30,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 03:14:30,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:14:30,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 03:14:30,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:14:30,660 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:14:30,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:14:30,683 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2025-03-08 03:14:30,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 03:14:30,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-08 03:14:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:14:30,684 INFO L225 Difference]: With dead ends: 36 [2025-03-08 03:14:30,684 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 03:14:30,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 03:14:30,685 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 03:14:30,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 03:14:30,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 03:14:30,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-08 03:14:30,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 03:14:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-03-08 03:14:30,691 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2025-03-08 03:14:30,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:14:30,691 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-03-08 03:14:30,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:14:30,691 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-03-08 03:14:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 03:14:30,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:14:30,692 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:14:30,696 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 (5)] Ended with exit code 0 [2025-03-08 03:14:30,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 03:14:30,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:14:30,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:14:30,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1880039140, now seen corresponding path program 1 times [2025-03-08 03:14:30,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:14:30,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016049136] [2025-03-08 03:14:30,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:14:30,893 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-08 03:14:30,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:14:30,895 INFO L229 MonitoredProcess]: Starting monitored process 6 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-08 03:14:30,896 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 (6)] Waiting until timeout for monitored process [2025-03-08 03:14:30,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 03:14:30,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 03:14:30,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:14:30,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:14:30,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 03:14:30,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:14:30,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 03:14:30,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:14:30,993 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:14:30,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016049136] [2025-03-08 03:14:30,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016049136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:14:30,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:14:30,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 03:14:30,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186823354] [2025-03-08 03:14:30,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:14:30,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 03:14:30,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:14:30,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 03:14:30,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 03:14:30,994 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:14:31,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:14:31,016 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-03-08 03:14:31,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 03:14:31,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-08 03:14:31,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:14:31,017 INFO L225 Difference]: With dead ends: 32 [2025-03-08 03:14:31,017 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 03:14:31,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 03:14:31,018 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 03:14:31,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 03:14:31,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 03:14:31,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-08 03:14:31,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 03:14:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-08 03:14:31,024 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2025-03-08 03:14:31,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:14:31,025 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-08 03:14:31,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:14:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-03-08 03:14:31,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 03:14:31,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:14:31,025 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:14:31,029 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 (6)] Ended with exit code 0 [2025-03-08 03:14:31,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-08 03:14:31,226 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:14:31,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:14:31,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1934330154, now seen corresponding path program 1 times [2025-03-08 03:14:31,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:14:31,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242620441] [2025-03-08 03:14:31,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:14:31,227 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-08 03:14:31,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:14:31,228 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 03:14:31,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-08 03:14:31,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 03:14:31,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 03:14:31,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:14:31,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:14:31,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 03:14:31,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:14:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 03:14:31,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:14:31,339 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:14:31,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242620441] [2025-03-08 03:14:31,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242620441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:14:31,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:14:31,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 03:14:31,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594203187] [2025-03-08 03:14:31,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:14:31,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 03:14:31,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:14:31,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 03:14:31,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 03:14:31,340 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:14:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:14:31,445 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-08 03:14:31,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 03:14:31,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-08 03:14:31,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:14:31,446 INFO L225 Difference]: With dead ends: 38 [2025-03-08 03:14:31,446 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 03:14:31,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 03:14:31,447 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 03:14:31,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 68 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 03:14:31,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 03:14:31,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-08 03:14:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 03:14:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2025-03-08 03:14:31,450 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 23 [2025-03-08 03:14:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:14:31,450 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2025-03-08 03:14:31,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:14:31,450 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2025-03-08 03:14:31,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 03:14:31,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 03:14:31,450 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:14:31,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-08 03:14:31,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 03:14:31,651 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 03:14:31,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 03:14:31,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1432350456, now seen corresponding path program 1 times [2025-03-08 03:14:31,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 03:14:31,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012881646] [2025-03-08 03:14:31,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 03:14:31,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 03:14:31,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 03:14:31,653 INFO L229 MonitoredProcess]: Starting monitored process 8 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-08 03:14:31,654 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 (8)] Waiting until timeout for monitored process [2025-03-08 03:14:31,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 03:14:31,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 03:14:31,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 03:14:31,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 03:14:31,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 03:14:31,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 03:14:31,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 03:14:31,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-08 03:14:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 03:14:31,825 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 03:14:31,825 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 03:14:31,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012881646] [2025-03-08 03:14:31,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012881646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 03:14:31,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 03:14:31,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 03:14:31,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448354334] [2025-03-08 03:14:31,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 03:14:31,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 03:14:31,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 03:14:31,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 03:14:31,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 03:14:31,826 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:14:31,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 03:14:31,879 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2025-03-08 03:14:31,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 03:14:31,880 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-08 03:14:31,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 03:14:31,880 INFO L225 Difference]: With dead ends: 21 [2025-03-08 03:14:31,880 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 03:14:31,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 03:14:31,881 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 03:14:31,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 95 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 03:14:31,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 03:14:31,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 03:14:31,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 03:14:31,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 03:14:31,882 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2025-03-08 03:14:31,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 03:14:31,882 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 03:14:31,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 03:14:31,882 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 03:14:31,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 03:14:31,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 03:14:31,887 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 (8)] Ended with exit code 0 [2025-03-08 03:14:32,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-08 03:14:32,087 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 03:14:32,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 03:14:32,163 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 03:14:32,168 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~32 [2025-03-08 03:14:32,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:14:32 BoogieIcfgContainer [2025-03-08 03:14:32,173 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 03:14:32,174 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 03:14:32,174 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 03:14:32,174 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 03:14:32,175 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:14:29" (3/4) ... [2025-03-08 03:14:32,176 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 03:14:32,180 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2025-03-08 03:14:32,184 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-08 03:14:32,184 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-08 03:14:32,184 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 03:14:32,184 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 03:14:32,204 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x) [2025-03-08 03:14:32,215 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x) [2025-03-08 03:14:32,244 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 03:14:32,244 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 03:14:32,244 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 03:14:32,245 INFO L158 Benchmark]: Toolchain (without parser) took 3561.47ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 30.9MB in the end (delta: 29.1MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2025-03-08 03:14:32,245 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 83.9MB. Free memory was 62.7MB in the beginning and 62.6MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:14:32,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.82ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 47.9MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 03:14:32,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.56ms. Allocated memory is still 83.9MB. Free memory was 47.9MB in the beginning and 46.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:14:32,246 INFO L158 Benchmark]: Boogie Preprocessor took 34.74ms. Allocated memory is still 83.9MB. Free memory was 46.5MB in the beginning and 44.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 03:14:32,247 INFO L158 Benchmark]: IcfgBuilder took 292.06ms. Allocated memory is still 83.9MB. Free memory was 44.9MB in the beginning and 31.3MB in the end (delta: 13.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 03:14:32,247 INFO L158 Benchmark]: TraceAbstraction took 2934.34ms. Allocated memory is still 83.9MB. Free memory was 30.7MB in the beginning and 36.9MB in the end (delta: -6.2MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2025-03-08 03:14:32,247 INFO L158 Benchmark]: Witness Printer took 70.58ms. Allocated memory is still 83.9MB. Free memory was 36.4MB in the beginning and 30.9MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 03:14:32,249 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.27ms. Allocated memory is still 83.9MB. Free memory was 62.7MB in the beginning and 62.6MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.82ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 47.9MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.56ms. Allocated memory is still 83.9MB. Free memory was 47.9MB in the beginning and 46.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.74ms. Allocated memory is still 83.9MB. Free memory was 46.5MB in the beginning and 44.9MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 292.06ms. Allocated memory is still 83.9MB. Free memory was 44.9MB in the beginning and 31.3MB in the end (delta: 13.6MB). There was no memory consumed. Max. memory is 16.1GB. * TraceAbstraction took 2934.34ms. Allocated memory is still 83.9MB. Free memory was 30.7MB in the beginning and 36.9MB in the end (delta: -6.2MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Witness Printer took 70.58ms. Allocated memory is still 83.9MB. Free memory was 36.4MB in the beginning and 30.9MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~Pluszero~32 * 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 - PositiveResult [Line: 72]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 41 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 526 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 359 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 185 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 167 mSDtfsCounter, 185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=5, InterpolantAutomatonStates: 38, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 128 ConstructedInterpolants, 6 QuantifiedInterpolants, 365 SizeOfPredicates, 11 NumberOfNonLiveVariables, 471 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 24/24 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Location Invariant Derived location invariant: (\old(x) == x) RESULT: Ultimate proved your program to be correct! [2025-03-08 03:14:32,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE