./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1232b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1232b.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 e29f062842798044f4f77e299bc6043cf6e874a22c0b9b512a8e0e54ddd042d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 16:13:32,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 16:13:32,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 16:13:32,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 16:13:32,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 16:13:32,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 16:13:32,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 16:13:32,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 16:13:32,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 16:13:32,821 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 16:13:32,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 16:13:32,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 16:13:32,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 16:13:32,821 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 16:13:32,821 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 16:13:32,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 16:13:32,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 16:13:32,823 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 16:13:32,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 16:13:32,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 16:13:32,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 16:13:32,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 16:13:32,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 16:13:32,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 16:13:32,824 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 16:13:32,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 16:13:32,824 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 16:13:32,824 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 16:13:32,824 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 16:13:32,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 16:13:32,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 16:13:32,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 16:13:32,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 16:13:32,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 16:13:32,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 16:13:32,825 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 16:13:32,825 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 16:13:32,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 16:13:32,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 16:13:32,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 16:13:32,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 16:13:32,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 16:13:32,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 16:13:32,826 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 -> e29f062842798044f4f77e299bc6043cf6e874a22c0b9b512a8e0e54ddd042d9 [2025-03-16 16:13:33,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 16:13:33,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 16:13:33,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 16:13:33,076 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 16:13:33,077 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 16:13:33,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1232b.c [2025-03-16 16:13:34,236 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2852b017/0688371b570b4989bc4b08edb34d2a49/FLAG3dd2c25f4 [2025-03-16 16:13:34,496 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 16:13:34,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232b.c [2025-03-16 16:13:34,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2852b017/0688371b570b4989bc4b08edb34d2a49/FLAG3dd2c25f4 [2025-03-16 16:13:34,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2852b017/0688371b570b4989bc4b08edb34d2a49 [2025-03-16 16:13:34,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 16:13:34,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 16:13:34,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 16:13:34,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 16:13:34,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 16:13:34,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 04:13:34" (1/1) ... [2025-03-16 16:13:34,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20041bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:34, skipping insertion in model container [2025-03-16 16:13:34,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 04:13:34" (1/1) ... [2025-03-16 16:13:34,827 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 16:13:34,950 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/double_req_bl_1232b.c[1958,1971] [2025-03-16 16:13:34,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 16:13:34,963 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 16:13:34,984 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/double_req_bl_1232b.c[1958,1971] [2025-03-16 16:13:34,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 16:13:34,999 INFO L204 MainTranslator]: Completed translation [2025-03-16 16:13:35,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:34 WrapperNode [2025-03-16 16:13:35,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 16:13:35,001 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 16:13:35,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 16:13:35,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 16:13:35,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:34" (1/1) ... [2025-03-16 16:13:35,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:34" (1/1) ... [2025-03-16 16:13:35,028 INFO L138 Inliner]: procedures = 19, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2025-03-16 16:13:35,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 16:13:35,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 16:13:35,030 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 16:13:35,030 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 16:13:35,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:34" (1/1) ... [2025-03-16 16:13:35,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:34" (1/1) ... [2025-03-16 16:13:35,038 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:34" (1/1) ... [2025-03-16 16:13:35,055 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 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-16 16:13:35,057 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:34" (1/1) ... [2025-03-16 16:13:35,057 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:34" (1/1) ... [2025-03-16 16:13:35,064 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:34" (1/1) ... [2025-03-16 16:13:35,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:34" (1/1) ... [2025-03-16 16:13:35,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:34" (1/1) ... [2025-03-16 16:13:35,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:34" (1/1) ... [2025-03-16 16:13:35,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 16:13:35,070 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 16:13:35,070 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 16:13:35,071 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 16:13:35,072 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:34" (1/1) ... [2025-03-16 16:13:35,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 16:13:35,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 16:13:35,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 16:13:35,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 16:13:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 16:13:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 16:13:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 16:13:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 16:13:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 16:13:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2025-03-16 16:13:35,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2025-03-16 16:13:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-16 16:13:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-16 16:13:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-16 16:13:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 16:13:35,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 16:13:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 16:13:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 16:13:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 16:13:35,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 16:13:35,186 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 16:13:35,188 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 16:13:35,332 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-16 16:13:35,332 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 16:13:35,340 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 16:13:35,341 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 16:13:35,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 04:13:35 BoogieIcfgContainer [2025-03-16 16:13:35,341 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 16:13:35,343 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 16:13:35,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 16:13:35,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 16:13:35,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 04:13:34" (1/3) ... [2025-03-16 16:13:35,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e349a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 04:13:35, skipping insertion in model container [2025-03-16 16:13:35,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:34" (2/3) ... [2025-03-16 16:13:35,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e349a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 04:13:35, skipping insertion in model container [2025-03-16 16:13:35,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 04:13:35" (3/3) ... [2025-03-16 16:13:35,348 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232b.c [2025-03-16 16:13:35,358 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 16:13:35,359 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_1232b.c that has 2 procedures, 29 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-03-16 16:13:35,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 16:13:35,406 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;@32d7591c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 16:13:35,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-16 16:13:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 25 states have internal predecessors, (39), 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-16 16:13:35,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 16:13:35,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:35,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 16:13:35,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [__fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE] === [2025-03-16 16:13:35,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:35,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2403907, now seen corresponding path program 1 times [2025-03-16 16:13:35,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 16:13:35,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034385509] [2025-03-16 16:13:35,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:35,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 16:13:35,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 16:13:35,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 16:13:35,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:35,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 16:13:35,479 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 16:13:35,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 16:13:35,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 16:13:35,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:35,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 16:13:35,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 16:13:35,498 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 16:13:35,499 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (2 of 3 remaining) [2025-03-16 16:13:35,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-16 16:13:35,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONUNSUPPORTED_FEATURE (0 of 3 remaining) [2025-03-16 16:13:35,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 16:13:35,504 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-16 16:13:35,514 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 16:13:35,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 04:13:35 BoogieIcfgContainer [2025-03-16 16:13:35,517 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 16:13:35,518 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 16:13:35,518 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 16:13:35,518 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 16:13:35,518 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 04:13:35" (3/4) ... [2025-03-16 16:13:35,520 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 16:13:35,520 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 16:13:35,521 INFO L158 Benchmark]: Toolchain (without parser) took 709.32ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 71.5MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 16:13:35,521 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 16:13:35,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.42ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 101.4MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 16:13:35,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.49ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 99.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 16:13:35,522 INFO L158 Benchmark]: Boogie Preprocessor took 38.06ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 98.6MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 16:13:35,522 INFO L158 Benchmark]: IcfgBuilder took 271.20ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 84.2MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 16:13:35,522 INFO L158 Benchmark]: TraceAbstraction took 174.49ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 72.0MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 16:13:35,522 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 142.6MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 16:13:35,523 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.17ms. Allocated memory is still 201.3MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.42ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 101.4MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.49ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 99.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.06ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 98.6MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 271.20ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 84.2MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 174.49ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 72.0MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 142.6MB. Free memory is still 71.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: 24]: 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 24, overapproximation of someUnaryDOUBLEoperation at line 76. Possible FailurePath: [L76] double x = -0.0; [L77] double y = 0.0; [L78] CALL fmin_double(x, y) [L48] CALL __fpclassify_double(x) VAL [\old(x)=49] [L21] __uint32_t msw, lsw; VAL [\old(x)=49] [L24] ieee_double_shape_type ew_u; VAL [\old(x)=49] - UnprovableResult [Line: 82]: 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: 60]: 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, 29 locations, 45 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, 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=29occurred 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, 4 NumberOfCodeBlocks, 4 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-16 16:13:35,534 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/double_req_bl_1232b.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 e29f062842798044f4f77e299bc6043cf6e874a22c0b9b512a8e0e54ddd042d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 16:13:37,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 16:13:37,513 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 16:13:37,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 16:13:37,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 16:13:37,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 16:13:37,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 16:13:37,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 16:13:37,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 16:13:37,552 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 16:13:37,553 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 16:13:37,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 16:13:37,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 16:13:37,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 16:13:37,554 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 16:13:37,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 16:13:37,554 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 16:13:37,554 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 16:13:37,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 16:13:37,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 16:13:37,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 16:13:37,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 16:13:37,555 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 16:13:37,555 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 16:13:37,555 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 16:13:37,555 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 16:13:37,555 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 16:13:37,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 16:13:37,555 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 16:13:37,555 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 16:13:37,556 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 16:13:37,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 16:13:37,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 16:13:37,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 16:13:37,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 16:13:37,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 16:13:37,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 16:13:37,557 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 16:13:37,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 16:13:37,557 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 16:13:37,557 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 16:13:37,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 16:13:37,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 16:13:37,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 16:13:37,558 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 16:13:37,558 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 -> e29f062842798044f4f77e299bc6043cf6e874a22c0b9b512a8e0e54ddd042d9 [2025-03-16 16:13:37,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 16:13:37,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 16:13:37,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 16:13:37,813 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 16:13:37,813 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 16:13:37,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1232b.c [2025-03-16 16:13:39,027 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc25222a5/f54585d1e0994718b73c8f2807a8b733/FLAG225699669 [2025-03-16 16:13:39,185 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 16:13:39,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232b.c [2025-03-16 16:13:39,192 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc25222a5/f54585d1e0994718b73c8f2807a8b733/FLAG225699669 [2025-03-16 16:13:39,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc25222a5/f54585d1e0994718b73c8f2807a8b733 [2025-03-16 16:13:39,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 16:13:39,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 16:13:39,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 16:13:39,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 16:13:39,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 16:13:39,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 04:13:39" (1/1) ... [2025-03-16 16:13:39,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f55b54f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:39, skipping insertion in model container [2025-03-16 16:13:39,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 04:13:39" (1/1) ... [2025-03-16 16:13:39,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 16:13:39,365 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/double_req_bl_1232b.c[1958,1971] [2025-03-16 16:13:39,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 16:13:39,379 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 16:13:39,403 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/double_req_bl_1232b.c[1958,1971] [2025-03-16 16:13:39,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 16:13:39,425 INFO L204 MainTranslator]: Completed translation [2025-03-16 16:13:39,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:39 WrapperNode [2025-03-16 16:13:39,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 16:13:39,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 16:13:39,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 16:13:39,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 16:13:39,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:39" (1/1) ... [2025-03-16 16:13:39,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:39" (1/1) ... [2025-03-16 16:13:39,463 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2025-03-16 16:13:39,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 16:13:39,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 16:13:39,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 16:13:39,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 16:13:39,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:39" (1/1) ... [2025-03-16 16:13:39,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:39" (1/1) ... [2025-03-16 16:13:39,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:39" (1/1) ... [2025-03-16 16:13:39,489 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [3, 2, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 2 writes are split as follows [1, 0, 1]. [2025-03-16 16:13:39,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:39" (1/1) ... [2025-03-16 16:13:39,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:39" (1/1) ... [2025-03-16 16:13:39,500 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:39" (1/1) ... [2025-03-16 16:13:39,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:39" (1/1) ... [2025-03-16 16:13:39,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:39" (1/1) ... [2025-03-16 16:13:39,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:39" (1/1) ... [2025-03-16 16:13:39,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 16:13:39,510 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 16:13:39,510 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 16:13:39,510 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 16:13:39,513 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:39" (1/1) ... [2025-03-16 16:13:39,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 16:13:39,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 16:13:39,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 16:13:39,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 16:13:39,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 16:13:39,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-16 16:13:39,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-16 16:13:39,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-16 16:13:39,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 16:13:39,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-16 16:13:39,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-16 16:13:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 16:13:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2025-03-16 16:13:39,562 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2025-03-16 16:13:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-16 16:13:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-16 16:13:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-16 16:13:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 16:13:39,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 16:13:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 16:13:39,627 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 16:13:39,629 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 16:13:39,835 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-16 16:13:39,835 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 16:13:39,842 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 16:13:39,842 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 16:13:39,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 04:13:39 BoogieIcfgContainer [2025-03-16 16:13:39,842 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 16:13:39,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 16:13:39,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 16:13:39,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 16:13:39,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 04:13:39" (1/3) ... [2025-03-16 16:13:39,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f324db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 04:13:39, skipping insertion in model container [2025-03-16 16:13:39,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 04:13:39" (2/3) ... [2025-03-16 16:13:39,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f324db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 04:13:39, skipping insertion in model container [2025-03-16 16:13:39,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 04:13:39" (3/3) ... [2025-03-16 16:13:39,853 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232b.c [2025-03-16 16:13:39,865 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 16:13:39,866 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_1232b.c that has 2 procedures, 25 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 16:13:39,909 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 16:13:39,920 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;@352d24a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 16:13:39,920 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 16:13:39,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 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-16 16:13:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 16:13:39,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:39,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:39,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:39,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:39,935 INFO L85 PathProgramCache]: Analyzing trace with hash -952449049, now seen corresponding path program 1 times [2025-03-16 16:13:39,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:39,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398510592] [2025-03-16 16:13:39,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:39,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 16:13:39,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:39,945 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 16:13:39,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-16 16:13:40,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 16:13:40,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 16:13:40,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:40,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:40,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 16:13:40,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:40,062 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-16 16:13:40,064 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:40,065 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:40,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398510592] [2025-03-16 16:13:40,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398510592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:40,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:40,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 16:13:40,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728170445] [2025-03-16 16:13:40,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:40,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 16:13:40,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:40,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 16:13:40,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 16:13:40,087 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 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.0) internal successors, (10), 2 states have internal predecessors, (10), 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-16 16:13:40,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:40,104 INFO L93 Difference]: Finished difference Result 48 states and 73 transitions. [2025-03-16 16:13:40,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 16:13:40,105 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 12 [2025-03-16 16:13:40,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:40,110 INFO L225 Difference]: With dead ends: 48 [2025-03-16 16:13:40,110 INFO L226 Difference]: Without dead ends: 22 [2025-03-16 16:13:40,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 16:13:40,118 INFO L435 NwaCegarLoop]: 32 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, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 16:13:40,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 16:13:40,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-16 16:13:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-16 16:13:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 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-16 16:13:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2025-03-16 16:13:40,151 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 12 [2025-03-16 16:13:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:40,152 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-03-16 16:13:40,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-16 16:13:40,153 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2025-03-16 16:13:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 16:13:40,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:40,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:40,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-16 16:13:40,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 16:13:40,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:40,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:40,356 INFO L85 PathProgramCache]: Analyzing trace with hash 593474505, now seen corresponding path program 1 times [2025-03-16 16:13:40,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:40,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529717778] [2025-03-16 16:13:40,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:40,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 16:13:40,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:40,359 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 16:13:40,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-16 16:13:40,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 16:13:40,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 16:13:40,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:40,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:40,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 16:13:40,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:40,472 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-16 16:13:40,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:40,472 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:40,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529717778] [2025-03-16 16:13:40,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529717778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:40,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:40,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 16:13:40,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602382915] [2025-03-16 16:13:40,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:40,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 16:13:40,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:40,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 16:13:40,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 16:13:40,476 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-16 16:13:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:40,509 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2025-03-16 16:13:40,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 16:13:40,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-16 16:13:40,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:40,513 INFO L225 Difference]: With dead ends: 33 [2025-03-16 16:13:40,513 INFO L226 Difference]: Without dead ends: 25 [2025-03-16 16:13:40,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-16 16:13:40,514 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 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-16 16:13:40,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 16:13:40,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-16 16:13:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-16 16:13:40,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 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), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-16 16:13:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2025-03-16 16:13:40,524 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 13 [2025-03-16 16:13:40,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:40,524 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-03-16 16:13:40,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-16 16:13:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2025-03-16 16:13:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 16:13:40,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:40,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:40,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-16 16:13:40,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 16:13:40,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:40,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:40,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2138702883, now seen corresponding path program 1 times [2025-03-16 16:13:40,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:40,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022333899] [2025-03-16 16:13:40,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:40,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 16:13:40,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:40,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 16:13:40,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-16 16:13:40,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 16:13:40,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 16:13:40,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:40,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:40,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 16:13:40,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:40,977 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-16 16:13:40,977 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:40,977 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:40,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022333899] [2025-03-16 16:13:40,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022333899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:40,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:40,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 16:13:40,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887296972] [2025-03-16 16:13:40,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:40,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 16:13:40,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:40,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 16:13:40,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 16:13:40,979 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-16 16:13:41,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:41,270 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2025-03-16 16:13:41,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 16:13:41,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-16 16:13:41,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:41,273 INFO L225 Difference]: With dead ends: 50 [2025-03-16 16:13:41,273 INFO L226 Difference]: Without dead ends: 28 [2025-03-16 16:13:41,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 16:13:41,274 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 16:13:41,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 67 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 16:13:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-16 16:13:41,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2025-03-16 16:13:41,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 16:13:41,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-03-16 16:13:41,282 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2025-03-16 16:13:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:41,282 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-16 16:13:41,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-16 16:13:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-03-16 16:13:41,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 16:13:41,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:41,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:41,286 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 (4)] Forceful destruction successful, exit code 0 [2025-03-16 16:13:41,486 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-16 16:13:41,486 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:41,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:41,486 INFO L85 PathProgramCache]: Analyzing trace with hash -436072986, now seen corresponding path program 1 times [2025-03-16 16:13:41,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:41,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065608532] [2025-03-16 16:13:41,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:41,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 16:13:41,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:41,489 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-16 16:13:41,490 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-16 16:13:41,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 16:13:41,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 16:13:41,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:41,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:41,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 16:13:41,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:41,551 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-16 16:13:41,551 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:41,551 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:41,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065608532] [2025-03-16 16:13:41,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065608532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:41,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:41,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 16:13:41,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851412651] [2025-03-16 16:13:41,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:41,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 16:13:41,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:41,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 16:13:41,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 16:13:41,552 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-16 16:13:41,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:41,584 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2025-03-16 16:13:41,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 16:13:41,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-16 16:13:41,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:41,586 INFO L225 Difference]: With dead ends: 38 [2025-03-16 16:13:41,586 INFO L226 Difference]: Without dead ends: 30 [2025-03-16 16:13:41,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-16 16:13:41,587 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 16:13:41,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 16:13:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-16 16:13:41,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2025-03-16 16:13:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 16:13:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-03-16 16:13:41,593 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 15 [2025-03-16 16:13:41,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:41,593 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-16 16:13:41,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-16 16:13:41,593 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-03-16 16:13:41,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 16:13:41,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:41,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:41,597 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-16 16:13:41,794 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-16 16:13:41,794 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:41,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:41,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1881961632, now seen corresponding path program 1 times [2025-03-16 16:13:41,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:41,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255097887] [2025-03-16 16:13:41,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:41,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 16:13:41,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:41,797 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-16 16:13:41,798 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-16 16:13:41,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-16 16:13:41,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 16:13:41,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:41,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:41,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 16:13:41,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:41,986 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-16 16:13:41,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:41,986 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:41,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255097887] [2025-03-16 16:13:41,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255097887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:41,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:41,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 16:13:41,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201872029] [2025-03-16 16:13:41,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:41,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 16:13:41,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:41,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 16:13:41,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 16:13:41,987 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-16 16:13:43,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:43,239 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2025-03-16 16:13:43,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 16:13:43,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 16 [2025-03-16 16:13:43,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:43,241 INFO L225 Difference]: With dead ends: 50 [2025-03-16 16:13:43,241 INFO L226 Difference]: Without dead ends: 26 [2025-03-16 16:13:43,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 16:13:43,241 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 16:13:43,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 63 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 16:13:43,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-16 16:13:43,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-03-16 16:13:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 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-16 16:13:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-03-16 16:13:43,245 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2025-03-16 16:13:43,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:43,245 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-03-16 16:13:43,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-16 16:13:43,246 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-03-16 16:13:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 16:13:43,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:43,246 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:43,250 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-16 16:13:43,447 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-16 16:13:43,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:43,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:43,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1214278581, now seen corresponding path program 1 times [2025-03-16 16:13:43,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:43,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367703407] [2025-03-16 16:13:43,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:43,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 16:13:43,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:43,450 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-16 16:13:43,451 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-16 16:13:43,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 16:13:43,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 16:13:43,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:43,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:43,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 16:13:43,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:43,529 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-16 16:13:43,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:43,530 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:43,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367703407] [2025-03-16 16:13:43,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367703407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:43,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:43,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 16:13:43,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557242167] [2025-03-16 16:13:43,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:43,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 16:13:43,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:43,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 16:13:43,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 16:13:43,530 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-16 16:13:43,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:43,552 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-03-16 16:13:43,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 16:13:43,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 21 [2025-03-16 16:13:43,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:43,553 INFO L225 Difference]: With dead ends: 35 [2025-03-16 16:13:43,553 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 16:13:43,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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-16 16:13:43,553 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 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-16 16:13:43,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 16:13:43,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 16:13:43,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-16 16:13:43,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 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), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 16:13:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-03-16 16:13:43,559 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 21 [2025-03-16 16:13:43,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:43,559 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-03-16 16:13:43,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-16 16:13:43,560 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-03-16 16:13:43,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 16:13:43,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:43,560 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:43,564 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-16 16:13:43,761 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-16 16:13:43,761 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:43,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:43,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1212431539, now seen corresponding path program 1 times [2025-03-16 16:13:43,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:43,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770516739] [2025-03-16 16:13:43,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:43,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 16:13:43,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:43,764 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-16 16:13:43,765 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-16 16:13:43,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 16:13:43,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 16:13:43,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:43,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:43,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 16:13:43,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:43,866 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-16 16:13:43,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:43,867 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:43,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770516739] [2025-03-16 16:13:43,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770516739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:43,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:43,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 16:13:43,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266304740] [2025-03-16 16:13:43,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:43,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 16:13:43,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:43,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 16:13:43,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 16:13:43,868 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-16 16:13:43,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:43,914 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2025-03-16 16:13:43,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 16:13:43,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 21 [2025-03-16 16:13:43,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:43,915 INFO L225 Difference]: With dead ends: 32 [2025-03-16 16:13:43,915 INFO L226 Difference]: Without dead ends: 29 [2025-03-16 16:13:43,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-16 16:13:43,918 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 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-16 16:13:43,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 16:13:43,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-16 16:13:43,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-16 16:13:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 16:13:43,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-03-16 16:13:43,925 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 21 [2025-03-16 16:13:43,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:43,925 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-03-16 16:13:43,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-16 16:13:43,925 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-03-16 16:13:43,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 16:13:43,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:43,925 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:43,932 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-16 16:13:44,126 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-16 16:13:44,126 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:44,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:44,126 INFO L85 PathProgramCache]: Analyzing trace with hash -505758021, now seen corresponding path program 1 times [2025-03-16 16:13:44,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:44,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773396143] [2025-03-16 16:13:44,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:44,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 16:13:44,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:44,129 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 16:13:44,129 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 (9)] Waiting until timeout for monitored process [2025-03-16 16:13:44,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 16:13:44,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 16:13:44,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:44,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:44,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 16:13:44,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:44,310 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-16 16:13:44,310 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:44,310 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:44,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773396143] [2025-03-16 16:13:44,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773396143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:44,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:44,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 16:13:44,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260214859] [2025-03-16 16:13:44,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:44,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 16:13:44,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:44,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 16:13:44,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 16:13:44,311 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-16 16:13:44,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:44,463 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2025-03-16 16:13:44,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 16:13:44,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-16 16:13:44,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:44,465 INFO L225 Difference]: With dead ends: 42 [2025-03-16 16:13:44,465 INFO L226 Difference]: Without dead ends: 29 [2025-03-16 16:13:44,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 16:13:44,466 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 16:13:44,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 71 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 16:13:44,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-16 16:13:44,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-16 16:13:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 16:13:44,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-16 16:13:44,473 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2025-03-16 16:13:44,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:44,474 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-16 16:13:44,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-16 16:13:44,474 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-03-16 16:13:44,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 16:13:44,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:44,474 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-16 16:13:44,478 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 (9)] Forceful destruction successful, exit code 0 [2025-03-16 16:13:44,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 16:13:44,675 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:44,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:44,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1046294824, now seen corresponding path program 1 times [2025-03-16 16:13:44,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:44,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621737013] [2025-03-16 16:13:44,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:44,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 16:13:44,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:44,678 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 16:13:44,679 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 (10)] Waiting until timeout for monitored process [2025-03-16 16:13:44,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 16:13:44,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 16:13:44,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:44,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 16:13:44,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 16:13:44,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 16:13:44,746 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-16 16:13:44,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 16:13:44,746 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 16:13:44,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621737013] [2025-03-16 16:13:44,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621737013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 16:13:44,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 16:13:44,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 16:13:44,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289885039] [2025-03-16 16:13:44,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 16:13:44,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 16:13:44,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 16:13:44,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 16:13:44,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 16:13:44,747 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-16 16:13:44,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 16:13:44,774 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2025-03-16 16:13:44,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 16:13:44,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-16 16:13:44,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 16:13:44,776 INFO L225 Difference]: With dead ends: 38 [2025-03-16 16:13:44,776 INFO L226 Difference]: Without dead ends: 30 [2025-03-16 16:13:44,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-16 16:13:44,776 INFO L435 NwaCegarLoop]: 30 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, 80 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-16 16:13:44,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 16:13:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-16 16:13:44,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2025-03-16 16:13:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) 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), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 16:13:44,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2025-03-16 16:13:44,780 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 23 [2025-03-16 16:13:44,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 16:13:44,780 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2025-03-16 16:13:44,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-16 16:13:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2025-03-16 16:13:44,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 16:13:44,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 16:13:44,782 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:44,785 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 (10)] Ended with exit code 0 [2025-03-16 16:13:44,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 16:13:44,982 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 16:13:44,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 16:13:44,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1104094474, now seen corresponding path program 1 times [2025-03-16 16:13:44,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 16:13:44,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434064286] [2025-03-16 16:13:44,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 16:13:44,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 16:13:44,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 16:13:44,985 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 16:13:44,985 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 (11)] Waiting until timeout for monitored process [2025-03-16 16:13:45,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 16:13:45,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 16:13:45,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:45,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 16:13:45,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 16:13:45,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 16:13:45,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 16:13:45,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 16:13:45,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 16:13:45,143 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-16 16:13:45,143 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 16:13:45,145 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 16:13:45,152 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 (11)] Ended with exit code 0 [2025-03-16 16:13:45,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 16:13:45,350 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 16:13:45,369 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 16:13:45,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 04:13:45 BoogieIcfgContainer [2025-03-16 16:13:45,375 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 16:13:45,378 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 16:13:45,378 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 16:13:45,378 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 16:13:45,379 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 04:13:39" (3/4) ... [2025-03-16 16:13:45,379 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-16 16:13:45,421 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 20. [2025-03-16 16:13:45,460 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 16:13:45,460 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 16:13:45,460 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 16:13:45,461 INFO L158 Benchmark]: Toolchain (without parser) took 6251.82ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 81.7MB in the end (delta: 11.3MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2025-03-16 16:13:45,461 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.3MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 16:13:45,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.23ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 80.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 16:13:45,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.10ms. Allocated memory is still 117.4MB. Free memory was 80.5MB in the beginning and 79.2MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 16:13:45,461 INFO L158 Benchmark]: Boogie Preprocessor took 45.06ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 77.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 16:13:45,461 INFO L158 Benchmark]: IcfgBuilder took 332.21ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 63.0MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 16:13:45,462 INFO L158 Benchmark]: TraceAbstraction took 5531.08ms. Allocated memory is still 117.4MB. Free memory was 62.2MB in the beginning and 87.7MB in the end (delta: -25.5MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2025-03-16 16:13:45,462 INFO L158 Benchmark]: Witness Printer took 82.42ms. Allocated memory is still 117.4MB. Free memory was 87.7MB in the beginning and 81.7MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 16:13:45,463 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.36ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.3MB in the end (delta: 37.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.23ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 80.5MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.10ms. Allocated memory is still 117.4MB. Free memory was 80.5MB in the beginning and 79.2MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.06ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 77.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 332.21ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 63.0MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5531.08ms. Allocated memory is still 117.4MB. Free memory was 62.2MB in the beginning and 87.7MB in the end (delta: -25.5MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * Witness Printer took 82.42ms. Allocated memory is still 117.4MB. Free memory was 87.7MB in the beginning and 81.7MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 82]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L76] double x = -0.0; [L77] double y = 0.0; [L78] CALL, EXPR fmin_double(x, y) [L48] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0.0] [L21] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L28] COND TRUE 0 [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (msw) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (lsw) = ew_u.parts.lsw [L28] COND FALSE !(0) VAL [\old(x)=0.0, lsw=0, msw=-2147483648, x=0.0] [L30-L31] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L32] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L48] RET, EXPR __fpclassify_double(x) VAL [x=0.0, y=0.0] [L48] COND FALSE !(__fpclassify_double(x) == 0) [L50] CALL, EXPR __fpclassify_double(y) VAL [\old(x)=0.0] [L21] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L28] COND TRUE 0 [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (msw) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (lsw) = ew_u.parts.lsw [L28] COND FALSE !(0) VAL [\old(x)=0.0, lsw=0, msw=0, x=0.0] [L30-L31] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L32] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L50] RET, EXPR __fpclassify_double(y) VAL [x=0.0, y=0.0] [L50] COND FALSE !(__fpclassify_double(y) == 0) [L53] return x < y ? x : y; VAL [\result=0.0] [L78] RET, EXPR fmin_double(x, y) [L78] double res = fmin_double(x, y); [L81] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=0.0] [L81] EXPR res == -0.0 && __signbit_double(res) == 1 [L81] CALL, EXPR __signbit_double(res) [L57] __uint32_t msw; VAL [x=0.0] [L63] COND TRUE 0 [L60] ieee_double_shape_type gh_u; [L61] gh_u.value = (x) [L62] EXPR gh_u.parts.msw [L62] (msw) = gh_u.parts.msw [L63] COND FALSE !(0) VAL [msw=0, x=0.0] [L65] return (msw & 0x80000000) != 0; [L81] RET, EXPR __signbit_double(res) [L81] EXPR res == -0.0 && __signbit_double(res) == 1 [L81] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L82] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 39 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 634 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 410 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 236 IncrementalHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 224 mSDtfsCounter, 236 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 148 ConstructedInterpolants, 17 QuantifiedInterpolants, 608 SizeOfPredicates, 11 NumberOfNonLiveVariables, 593 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-16 16:13:45,492 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE