./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-31.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e93de99482d94814bb61a39ae8aebe1d7604ed02e49ddec9cbe7f761e760f5e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:34:48,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:34:48,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:34:48,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:34:48,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:34:48,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:34:48,268 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:34:48,268 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:34:48,268 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:34:48,268 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:34:48,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:34:48,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:34:48,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:34:48,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:34:48,269 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:34:48,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:34:48,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:34:48,270 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:34:48,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:34:48,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:34:48,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:34:48,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:34:48,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:34:48,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:34:48,271 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:34:48,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:34:48,271 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:34:48,271 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:34:48,271 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:34:48,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:34:48,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:34:48,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:34:48,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:34:48,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:34:48,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:34:48,271 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:34:48,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:34:48,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:34:48,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:34:48,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:34:48,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:34:48,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:34:48,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:34:48,272 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 -> e93de99482d94814bb61a39ae8aebe1d7604ed02e49ddec9cbe7f761e760f5e6 [2025-03-08 13:34:48,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:34:48,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:34:48,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:34:48,519 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:34:48,520 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:34:48,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-31.i [2025-03-08 13:34:49,634 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c5f8f6e/7b21465755324000bbf9f822f6dbfbbe/FLAG46e1f3646 [2025-03-08 13:34:49,846 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:34:49,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-31.i [2025-03-08 13:34:49,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c5f8f6e/7b21465755324000bbf9f822f6dbfbbe/FLAG46e1f3646 [2025-03-08 13:34:50,204 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c5f8f6e/7b21465755324000bbf9f822f6dbfbbe [2025-03-08 13:34:50,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:34:50,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:34:50,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:34:50,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:34:50,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:34:50,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:34:50" (1/1) ... [2025-03-08 13:34:50,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37cc4922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:50, skipping insertion in model container [2025-03-08 13:34:50,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:34:50" (1/1) ... [2025-03-08 13:34:50,221 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:34:50,304 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-31.i[917,930] [2025-03-08 13:34:50,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:34:50,339 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:34:50,345 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-31.i[917,930] [2025-03-08 13:34:50,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:34:50,368 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:34:50,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:50 WrapperNode [2025-03-08 13:34:50,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:34:50,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:34:50,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:34:50,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:34:50,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:50" (1/1) ... [2025-03-08 13:34:50,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:50" (1/1) ... [2025-03-08 13:34:50,392 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2025-03-08 13:34:50,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:34:50,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:34:50,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:34:50,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:34:50,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:50" (1/1) ... [2025-03-08 13:34:50,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:50" (1/1) ... [2025-03-08 13:34:50,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:50" (1/1) ... [2025-03-08 13:34:50,411 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:34:50,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:50" (1/1) ... [2025-03-08 13:34:50,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:50" (1/1) ... [2025-03-08 13:34:50,414 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:50" (1/1) ... [2025-03-08 13:34:50,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:50" (1/1) ... [2025-03-08 13:34:50,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:50" (1/1) ... [2025-03-08 13:34:50,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:50" (1/1) ... [2025-03-08 13:34:50,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:34:50,419 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:34:50,419 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:34:50,419 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:34:50,419 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:50" (1/1) ... [2025-03-08 13:34:50,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:34:50,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:34:50,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:34:50,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:34:50,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:34:50,472 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:34:50,472 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:34:50,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:34:50,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:34:50,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:34:50,516 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:34:50,517 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:34:50,724 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 13:34:50,724 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:34:50,733 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:34:50,733 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:34:50,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:34:50 BoogieIcfgContainer [2025-03-08 13:34:50,734 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:34:50,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:34:50,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:34:50,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:34:50,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:34:50" (1/3) ... [2025-03-08 13:34:50,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1572bbbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:34:50, skipping insertion in model container [2025-03-08 13:34:50,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:50" (2/3) ... [2025-03-08 13:34:50,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1572bbbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:34:50, skipping insertion in model container [2025-03-08 13:34:50,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:34:50" (3/3) ... [2025-03-08 13:34:50,741 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-31.i [2025-03-08 13:34:50,754 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:34:50,755 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-31.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:34:50,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:34:50,811 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;@4a8cb796, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:34:50,812 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:34:50,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 13:34:50,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 13:34:50,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:50,822 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:34:50,822 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:50,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:50,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1023406542, now seen corresponding path program 1 times [2025-03-08 13:34:50,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:34:50,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481920247] [2025-03-08 13:34:50,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:50,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:34:50,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 13:34:50,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 13:34:50,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:50,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:50,994 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-08 13:34:50,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:34:50,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481920247] [2025-03-08 13:34:50,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481920247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:34:50,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498954259] [2025-03-08 13:34:50,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:50,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:34:50,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:34:50,998 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:34:50,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:34:51,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 13:34:51,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 13:34:51,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:51,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:51,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:34:51,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:34:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-08 13:34:51,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:34:51,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498954259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:34:51,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:34:51,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:34:51,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810207353] [2025-03-08 13:34:51,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:34:51,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:34:51,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:34:51,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:34:51,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:34:51,130 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 13:34:51,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:34:51,149 INFO L93 Difference]: Finished difference Result 82 states and 136 transitions. [2025-03-08 13:34:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:34:51,151 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 74 [2025-03-08 13:34:51,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:34:51,154 INFO L225 Difference]: With dead ends: 82 [2025-03-08 13:34:51,155 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 13:34:51,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:34:51,159 INFO L435 NwaCegarLoop]: 59 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, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:34:51,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:34:51,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 13:34:51,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-08 13:34:51,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 13:34:51,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2025-03-08 13:34:51,183 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 74 [2025-03-08 13:34:51,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:34:51,183 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2025-03-08 13:34:51,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 13:34:51,183 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2025-03-08 13:34:51,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 13:34:51,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:51,186 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:34:51,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 13:34:51,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:34:51,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:51,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:51,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1790245426, now seen corresponding path program 1 times [2025-03-08 13:34:51,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:34:51,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90872097] [2025-03-08 13:34:51,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:51,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:34:51,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 13:34:51,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 13:34:51,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:51,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:34:51,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [116998617] [2025-03-08 13:34:51,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:51,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:34:51,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:34:51,477 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:34:51,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 13:34:51,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 13:34:51,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 13:34:51,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:51,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:34:51,555 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:34:51,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 13:34:51,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 13:34:51,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:51,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:34:51,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:34:51,607 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:34:51,607 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:34:51,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 13:34:51,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 13:34:51,812 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 13:34:51,860 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:34:51,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:34:51 BoogieIcfgContainer [2025-03-08 13:34:51,862 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:34:51,862 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:34:51,862 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:34:51,862 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:34:51,863 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:34:50" (3/4) ... [2025-03-08 13:34:51,864 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:34:51,865 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:34:51,866 INFO L158 Benchmark]: Toolchain (without parser) took 1658.52ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 45.9MB in the end (delta: 86.9MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-03-08 13:34:51,866 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:34:51,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.22ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 120.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:34:51,868 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.62ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 118.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:34:51,869 INFO L158 Benchmark]: Boogie Preprocessor took 24.96ms. Allocated memory is still 167.8MB. Free memory was 118.2MB in the beginning and 116.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:34:51,869 INFO L158 Benchmark]: IcfgBuilder took 315.22ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 100.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:34:51,869 INFO L158 Benchmark]: TraceAbstraction took 1126.39ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 46.3MB in the end (delta: 53.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-08 13:34:51,869 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 167.8MB. Free memory was 46.3MB in the beginning and 45.9MB in the end (delta: 413.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:34:51,870 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.45ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 161.22ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 120.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.62ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 118.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.96ms. Allocated memory is still 167.8MB. Free memory was 118.2MB in the beginning and 116.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 315.22ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 100.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1126.39ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 46.3MB in the end (delta: 53.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 167.8MB. Free memory was 46.3MB in the beginning and 45.9MB in the end (delta: 413.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 200; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 1107940323; [L25] unsigned char var_1_6 = 0; [L26] signed long int var_1_7 = 4; [L27] signed long int var_1_8 = -32; [L28] unsigned char var_1_9 = 64; [L29] unsigned char var_1_12 = 4; [L30] double var_1_13 = 0.97; [L31] double var_1_14 = 32.6; [L32] signed long int last_1_var_1_7 = 4; [L33] double last_1_var_1_13 = 0.97; VAL [isInitial=0, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=0, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L92] last_1_var_1_7 = var_1_7 [L93] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=0, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L103] RET updateLastVariables() [L104] CALL updateVariables() [L73] var_1_2 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L74] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L75] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L75] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L76] var_1_3 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L77] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L78] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L78] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L79] var_1_6 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_7=4, var_1_8=-32, var_1_9=64] [L80] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_7=4, var_1_8=-32, var_1_9=64] [L81] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=-32, var_1_9=64] [L81] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=-32, var_1_9=64] [L82] var_1_8 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L83] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L84] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L84] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L85] var_1_12 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L86] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L87] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L87] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L88] var_1_14 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L89] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L104] RET updateVariables() [L105] CALL step() [L37] COND FALSE !(! (var_1_3 < (var_1_8 * last_1_var_1_7))) [L44] var_1_9 = var_1_12 VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=1] [L46] COND FALSE !(var_1_9 < var_1_9) [L49] var_1_7 = (var_1_9 - var_1_3) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L51] COND FALSE !((var_1_9 + var_1_3) < var_1_9) [L62] var_1_13 = var_1_14 VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L64] COND TRUE \read(var_1_2) [L65] var_1_1 = ((var_1_3 - var_1_9) - var_1_9) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=1073741821, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L105] RET step() [L106] CALL, EXPR property() [L96-L97] return (((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_9) - var_1_9))) : ((var_1_6 && (var_1_3 < var_1_9)) ? (var_1_1 == ((signed long int) var_1_3)) : 1)) && ((var_1_9 < var_1_9) ? (var_1_7 == ((signed long int) (var_1_9 + var_1_9))) : (var_1_7 == ((signed long int) (var_1_9 - var_1_3))))) && ((! (var_1_3 < (var_1_8 * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? (var_1_6 ? (var_1_9 == ((unsigned char) var_1_12)) : 1) : 1) : (var_1_9 == ((unsigned char) var_1_12)))) && (((var_1_9 + var_1_3) < var_1_9) ? ((var_1_2 && var_1_6) ? (var_1_6 ? (var_1_13 == ((double) 0.8)) : (var_1_13 == ((double) var_1_14))) : (var_1_13 == ((double) var_1_14))) : (var_1_13 == ((double) var_1_14))) ; VAL [\result=0, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=1073741821, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=1073741821, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=1073741821, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 76 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 59 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 185 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 420/440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 13:34:51,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-31.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e93de99482d94814bb61a39ae8aebe1d7604ed02e49ddec9cbe7f761e760f5e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:34:53,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:34:53,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:34:53,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:34:53,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:34:53,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:34:53,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:34:53,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:34:53,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:34:53,739 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:34:53,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:34:53,740 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:34:53,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:34:53,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:34:53,741 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:34:53,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:34:53,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:34:53,741 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:34:53,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:34:53,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:34:53,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:34:53,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:34:53,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:34:53,742 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:34:53,742 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:34:53,742 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:34:53,742 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:34:53,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:34:53,742 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:34:53,742 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:34:53,742 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:34:53,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:34:53,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:34:53,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:34:53,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:34:53,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:34:53,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:34:53,743 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:34:53,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:34:53,743 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:34:53,743 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:34:53,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:34:53,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:34:53,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:34:53,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:34:53,743 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 -> e93de99482d94814bb61a39ae8aebe1d7604ed02e49ddec9cbe7f761e760f5e6 [2025-03-08 13:34:53,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:34:53,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:34:53,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:34:53,995 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:34:53,995 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:34:53,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-31.i [2025-03-08 13:34:54,481 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3746288cc/ed410a1396fc41b9828369dbd0f3533f/FLAG418419424 [2025-03-08 13:34:56,035 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:34:56,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-31.i [2025-03-08 13:34:56,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3746288cc/ed410a1396fc41b9828369dbd0f3533f/FLAG418419424 [2025-03-08 13:34:56,388 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3746288cc/ed410a1396fc41b9828369dbd0f3533f [2025-03-08 13:34:56,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:34:56,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:34:56,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:34:56,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:34:56,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:34:56,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:34:56" (1/1) ... [2025-03-08 13:34:56,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14fd04ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:56, skipping insertion in model container [2025-03-08 13:34:56,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:34:56" (1/1) ... [2025-03-08 13:34:56,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:34:56,505 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-31.i[917,930] [2025-03-08 13:34:56,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:34:56,551 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:34:56,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-31.i[917,930] [2025-03-08 13:34:56,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:34:56,591 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:34:56,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:56 WrapperNode [2025-03-08 13:34:56,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:34:56,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:34:56,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:34:56,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:34:56,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:56" (1/1) ... [2025-03-08 13:34:56,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:56" (1/1) ... [2025-03-08 13:34:56,627 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2025-03-08 13:34:56,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:34:56,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:34:56,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:34:56,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:34:56,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:56" (1/1) ... [2025-03-08 13:34:56,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:56" (1/1) ... [2025-03-08 13:34:56,639 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:56" (1/1) ... [2025-03-08 13:34:56,649 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:34:56,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:56" (1/1) ... [2025-03-08 13:34:56,650 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:56" (1/1) ... [2025-03-08 13:34:56,658 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:56" (1/1) ... [2025-03-08 13:34:56,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:56" (1/1) ... [2025-03-08 13:34:56,664 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:56" (1/1) ... [2025-03-08 13:34:56,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:56" (1/1) ... [2025-03-08 13:34:56,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:34:56,668 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:34:56,668 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:34:56,668 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:34:56,669 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:56" (1/1) ... [2025-03-08 13:34:56,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:34:56,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:34:56,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:34:56,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:34:56,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:34:56,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:34:56,719 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:34:56,719 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:34:56,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:34:56,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:34:56,767 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:34:56,768 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:34:56,941 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 13:34:56,941 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:34:56,948 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:34:56,949 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:34:56,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:34:56 BoogieIcfgContainer [2025-03-08 13:34:56,950 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:34:56,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:34:56,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:34:56,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:34:56,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:34:56" (1/3) ... [2025-03-08 13:34:56,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32df5668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:34:56, skipping insertion in model container [2025-03-08 13:34:56,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:34:56" (2/3) ... [2025-03-08 13:34:56,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32df5668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:34:56, skipping insertion in model container [2025-03-08 13:34:56,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:34:56" (3/3) ... [2025-03-08 13:34:56,957 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-31.i [2025-03-08 13:34:56,967 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:34:56,968 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-31.i that has 2 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:34:57,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:34:57,015 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;@14d6bea8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:34:57,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:34:57,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 13:34:57,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 13:34:57,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:57,026 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:34:57,027 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:57,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:57,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1023406542, now seen corresponding path program 1 times [2025-03-08 13:34:57,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:34:57,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153779722] [2025-03-08 13:34:57,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:57,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:34:57,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:34:57,046 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:34:57,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 13:34:57,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 13:34:57,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 13:34:57,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:57,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:57,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:34:57,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:34:57,217 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-08 13:34:57,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:34:57,219 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:34:57,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153779722] [2025-03-08 13:34:57,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153779722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:34:57,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:34:57,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:34:57,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749550635] [2025-03-08 13:34:57,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:34:57,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:34:57,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:34:57,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:34:57,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:34:57,239 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 13:34:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:34:57,255 INFO L93 Difference]: Finished difference Result 81 states and 134 transitions. [2025-03-08 13:34:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:34:57,258 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 74 [2025-03-08 13:34:57,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:34:57,262 INFO L225 Difference]: With dead ends: 81 [2025-03-08 13:34:57,262 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 13:34:57,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:34:57,267 INFO L435 NwaCegarLoop]: 56 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, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:34:57,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:34:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 13:34:57,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 13:34:57,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 13:34:57,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2025-03-08 13:34:57,300 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 74 [2025-03-08 13:34:57,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:34:57,300 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2025-03-08 13:34:57,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 13:34:57,301 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2025-03-08 13:34:57,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 13:34:57,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:57,304 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:34:57,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 13:34:57,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:34:57,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:57,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:57,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1790245426, now seen corresponding path program 1 times [2025-03-08 13:34:57,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:34:57,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105636867] [2025-03-08 13:34:57,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:57,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:34:57,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:34:57,508 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:34:57,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 13:34:57,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 13:34:57,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 13:34:57,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:57,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:57,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 13:34:57,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:35:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-08 13:35:25,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:35:25,204 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:35:25,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105636867] [2025-03-08 13:35:25,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105636867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:35:25,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:35:25,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 13:35:25,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492640823] [2025-03-08 13:35:25,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:35:25,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 13:35:25,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:35:25,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 13:35:25,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-08 13:35:25,207 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 13:35:26,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:35:26,426 INFO L93 Difference]: Finished difference Result 113 states and 151 transitions. [2025-03-08 13:35:26,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 13:35:26,427 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2025-03-08 13:35:26,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:35:26,429 INFO L225 Difference]: With dead ends: 113 [2025-03-08 13:35:26,430 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 13:35:26,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2025-03-08 13:35:26,431 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 89 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 13:35:26,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 298 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 13:35:26,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 13:35:26,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 74. [2025-03-08 13:35:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:35:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2025-03-08 13:35:26,442 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 74 [2025-03-08 13:35:26,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:35:26,444 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2025-03-08 13:35:26,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 13:35:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2025-03-08 13:35:26,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 13:35:26,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:35:26,446 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:35:26,452 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-08 13:35:26,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:35:26,647 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:35:26,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:35:26,647 INFO L85 PathProgramCache]: Analyzing trace with hash 424762678, now seen corresponding path program 1 times [2025-03-08 13:35:26,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:35:26,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816460788] [2025-03-08 13:35:26,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:35:26,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:35:26,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:35:26,650 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:35:26,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 13:35:26,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 13:35:26,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 13:35:26,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:35:26,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:35:26,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 13:35:26,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:35:26,796 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 13:35:26,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:35:26,844 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:35:26,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816460788] [2025-03-08 13:35:26,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816460788] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:35:26,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [357874599] [2025-03-08 13:35:26,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:35:26,845 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 13:35:26,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 13:35:26,849 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 13:35:26,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-08 13:35:26,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 13:35:27,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 13:35:27,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:35:27,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:35:27,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 13:35:27,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:35:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-08 13:35:27,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:35:27,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [357874599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:35:27,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 13:35:27,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2025-03-08 13:35:27,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362654620] [2025-03-08 13:35:27,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 13:35:27,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 13:35:27,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:35:27,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 13:35:27,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 13:35:27,272 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 13:35:27,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:35:27,432 INFO L93 Difference]: Finished difference Result 123 states and 165 transitions. [2025-03-08 13:35:27,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 13:35:27,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 75 [2025-03-08 13:35:27,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:35:27,435 INFO L225 Difference]: With dead ends: 123 [2025-03-08 13:35:27,435 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 13:35:27,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:35:27,436 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 22 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:35:27,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 81 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:35:27,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 13:35:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2025-03-08 13:35:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:35:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2025-03-08 13:35:27,448 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 75 [2025-03-08 13:35:27,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:35:27,448 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2025-03-08 13:35:27,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 13:35:27,448 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2025-03-08 13:35:27,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 13:35:27,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:35:27,449 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:35:27,454 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-08 13:35:27,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-08 13:35:27,850 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 13:35:27,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:35:27,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:35:27,851 INFO L85 PathProgramCache]: Analyzing trace with hash 425686199, now seen corresponding path program 1 times [2025-03-08 13:35:27,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:35:27,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800713093] [2025-03-08 13:35:27,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:35:27,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:35:27,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:35:27,854 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:35:27,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 13:35:27,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 13:35:27,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 13:35:27,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:35:27,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:35:27,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 13:35:27,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:36:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-08 13:36:24,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:36:24,698 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:36:24,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800713093] [2025-03-08 13:36:24,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800713093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:36:24,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:36:24,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 13:36:24,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198445143] [2025-03-08 13:36:24,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:36:24,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 13:36:24,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:36:24,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 13:36:24,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-08 13:36:24,699 INFO L87 Difference]: Start difference. First operand 82 states and 107 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 13:36:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:36:25,924 INFO L93 Difference]: Finished difference Result 119 states and 151 transitions. [2025-03-08 13:36:25,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 13:36:25,924 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 75 [2025-03-08 13:36:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:36:25,925 INFO L225 Difference]: With dead ends: 119 [2025-03-08 13:36:25,925 INFO L226 Difference]: Without dead ends: 117 [2025-03-08 13:36:25,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2025-03-08 13:36:25,926 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 123 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 13:36:25,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 268 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 13:36:25,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-08 13:36:25,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 83. [2025-03-08 13:36:25,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:36:25,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 108 transitions. [2025-03-08 13:36:25,938 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 108 transitions. Word has length 75 [2025-03-08 13:36:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:36:25,938 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 108 transitions. [2025-03-08 13:36:25,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 13:36:25,938 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2025-03-08 13:36:25,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 13:36:25,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:36:25,939 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:36:25,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-08 13:36:26,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:36:26,139 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:36:26,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:36:26,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1397230291, now seen corresponding path program 1 times [2025-03-08 13:36:26,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:36:26,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160941815] [2025-03-08 13:36:26,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:36:26,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:36:26,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:36:26,143 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:36:26,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-08 13:36:26,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 13:36:26,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 13:36:26,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:36:26,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:36:26,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 13:36:26,228 INFO L279 TraceCheckSpWp]: Computing forward predicates...