./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/rlim_invariant.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/rlim_invariant.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 d395d439ec4556dc83dba3523bab6fe5cf68ec358a108cd3824067669c5e9bc5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:46:53,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:46:53,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:46:53,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:46:53,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:46:53,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:46:53,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:46:53,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:46:53,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:46:53,671 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:46:53,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:46:53,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:46:53,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:46:53,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:46:53,671 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:46:53,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:46:53,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:46:53,672 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:46:53,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:46:53,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:46:53,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:46:53,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:46:53,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:46:53,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:46:53,672 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:46:53,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:46:53,672 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:46:53,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:46:53,673 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:46:53,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:46:53,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:46:53,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:46:53,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:46:53,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:46:53,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:46:53,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:46:53,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:46:53,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:46:53,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:46:53,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:46:53,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:46:53,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:46:53,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:46:53,674 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-jdk21/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 -> d395d439ec4556dc83dba3523bab6fe5cf68ec358a108cd3824067669c5e9bc5 [2025-02-05 12:46:53,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:46:53,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:46:53,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:46:53,900 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:46:53,900 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:46:53,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/rlim_invariant.c [2025-02-05 12:46:55,103 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa85e6e1d/93e56cd1c470458d9ebae6d3efda3c91/FLAG89b868df2 [2025-02-05 12:46:55,297 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:46:55,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c [2025-02-05 12:46:55,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa85e6e1d/93e56cd1c470458d9ebae6d3efda3c91/FLAG89b868df2 [2025-02-05 12:46:55,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa85e6e1d/93e56cd1c470458d9ebae6d3efda3c91 [2025-02-05 12:46:55,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:46:55,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:46:55,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:46:55,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:46:55,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:46:55,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:46:55" (1/1) ... [2025-02-05 12:46:55,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34f9110b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:55, skipping insertion in model container [2025-02-05 12:46:55,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:46:55" (1/1) ... [2025-02-05 12:46:55,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:46:55,463 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c[451,464] [2025-02-05 12:46:55,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:46:55,486 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:46:55,495 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c[451,464] [2025-02-05 12:46:55,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:46:55,511 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:46:55,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:55 WrapperNode [2025-02-05 12:46:55,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:46:55,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:46:55,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:46:55,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:46:55,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:55" (1/1) ... [2025-02-05 12:46:55,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:55" (1/1) ... [2025-02-05 12:46:55,532 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 45 [2025-02-05 12:46:55,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:46:55,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:46:55,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:46:55,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:46:55,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:55" (1/1) ... [2025-02-05 12:46:55,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:55" (1/1) ... [2025-02-05 12:46:55,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:55" (1/1) ... [2025-02-05 12:46:55,549 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-02-05 12:46:55,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:55" (1/1) ... [2025-02-05 12:46:55,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:55" (1/1) ... [2025-02-05 12:46:55,551 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:55" (1/1) ... [2025-02-05 12:46:55,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:55" (1/1) ... [2025-02-05 12:46:55,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:55" (1/1) ... [2025-02-05 12:46:55,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:55" (1/1) ... [2025-02-05 12:46:55,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:46:55,555 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:46:55,555 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:46:55,555 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:46:55,555 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:55" (1/1) ... [2025-02-05 12:46:55,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:46:55,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:46:55,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 12:46:55,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 12:46:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:46:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 12:46:55,598 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 12:46:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:46:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:46:55,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:46:55,636 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:46:55,637 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:46:55,746 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-02-05 12:46:55,746 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:46:55,756 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:46:55,757 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:46:55,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:46:55 BoogieIcfgContainer [2025-02-05 12:46:55,758 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:46:55,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:46:55,761 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:46:55,764 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:46:55,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:46:55" (1/3) ... [2025-02-05 12:46:55,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d70b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:46:55, skipping insertion in model container [2025-02-05 12:46:55,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:55" (2/3) ... [2025-02-05 12:46:55,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d70b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:46:55, skipping insertion in model container [2025-02-05 12:46:55,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:46:55" (3/3) ... [2025-02-05 12:46:55,767 INFO L128 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c [2025-02-05 12:46:55,779 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:46:55,780 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rlim_invariant.c that has 2 procedures, 20 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:46:55,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:46:55,838 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;@2bff2831, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:46:55,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:46:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 12:46:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 12:46:55,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:46:55,848 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:46:55,849 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:46:55,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:46:55,854 INFO L85 PathProgramCache]: Analyzing trace with hash 941859775, now seen corresponding path program 1 times [2025-02-05 12:46:55,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:46:55,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885854197] [2025-02-05 12:46:55,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:46:55,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:46:55,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 12:46:55,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 12:46:55,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:46:55,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:46:55,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 12:46:55,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:46:55,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885854197] [2025-02-05 12:46:55,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885854197] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:46:55,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087743484] [2025-02-05 12:46:55,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:46:55,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:46:55,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:46:55,956 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:46:55,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 12:46:55,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 12:46:55,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 12:46:55,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:46:55,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:46:56,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 12:46:56,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:46:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 12:46:56,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:46:56,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087743484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:46:56,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 12:46:56,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 12:46:56,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367071139] [2025-02-05 12:46:56,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:46:56,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 12:46:56,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:46:56,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 12:46:56,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 12:46:56,027 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 12:46:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:46:56,037 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2025-02-05 12:46:56,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 12:46:56,038 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-02-05 12:46:56,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:46:56,042 INFO L225 Difference]: With dead ends: 38 [2025-02-05 12:46:56,043 INFO L226 Difference]: Without dead ends: 17 [2025-02-05 12:46:56,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 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-02-05 12:46:56,048 INFO L435 NwaCegarLoop]: 23 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, 23 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-02-05 12:46:56,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 12:46:56,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-02-05 12:46:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-02-05 12:46:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 12:46:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2025-02-05 12:46:56,073 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 18 [2025-02-05 12:46:56,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:46:56,074 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-02-05 12:46:56,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 12:46:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2025-02-05 12:46:56,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 12:46:56,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:46:56,075 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:46:56,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 12:46:56,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 12:46:56,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:46:56,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:46:56,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1903700193, now seen corresponding path program 1 times [2025-02-05 12:46:56,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:46:56,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923585367] [2025-02-05 12:46:56,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:46:56,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:46:56,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 12:46:56,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 12:46:56,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:46:56,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 12:46:56,295 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 12:46:56,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 12:46:56,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 12:46:56,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:46:56,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 12:46:56,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 12:46:56,326 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 12:46:56,327 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 12:46:56,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:46:56,331 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-05 12:46:56,341 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 12:46:56,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 12:46:56 BoogieIcfgContainer [2025-02-05 12:46:56,343 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 12:46:56,344 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 12:46:56,344 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 12:46:56,344 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 12:46:56,345 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:46:55" (3/4) ... [2025-02-05 12:46:56,346 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 12:46:56,347 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 12:46:56,347 INFO L158 Benchmark]: Toolchain (without parser) took 1002.13ms. Allocated memory is still 167.8MB. Free memory was 125.1MB in the beginning and 75.5MB in the end (delta: 49.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-05 12:46:56,348 INFO L158 Benchmark]: CDTParser took 0.97ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 12:46:56,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.75ms. Allocated memory is still 167.8MB. Free memory was 125.1MB in the beginning and 113.6MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 12:46:56,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.12ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 112.9MB in the end (delta: 739.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 12:46:56,348 INFO L158 Benchmark]: Boogie Preprocessor took 21.22ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 112.0MB in the end (delta: 856.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 12:46:56,348 INFO L158 Benchmark]: IcfgBuilder took 202.94ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 100.6MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 12:46:56,349 INFO L158 Benchmark]: TraceAbstraction took 583.74ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 75.5MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 12:46:56,349 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 167.8MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 12:46:56,350 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.97ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 165.75ms. Allocated memory is still 167.8MB. Free memory was 125.1MB in the beginning and 113.6MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.12ms. Allocated memory is still 167.8MB. Free memory was 113.6MB in the beginning and 112.9MB in the end (delta: 739.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.22ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 112.0MB in the end (delta: 856.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 202.94ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 100.6MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 583.74ms. Allocated memory is still 167.8MB. Free memory was 99.9MB in the beginning and 75.5MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 167.8MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 10]: 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 someBinaryFLOATComparisonOperation at line 24, overapproximation of someBinaryFLOATComparisonOperation at line 23, overapproximation of someBinaryFLOATComparisonOperation at line 32, overapproximation of someBinaryFLOATComparisonOperation at line 29, overapproximation of to_real at line 17, overapproximation of someBinaryArithmeticFLOAToperation at line 29, overapproximation of someBinaryArithmeticFLOAToperation at line 28. Possible FailurePath: [L14] float X, Y, S, R, D; [L15] int i; [L17] Y = 0 [L19] i = 0 VAL [i=0] [L19] COND TRUE i < 100000 [L21] X = __VERIFIER_nondet_float() [L22] D = __VERIFIER_nondet_float() [L23] CALL assume_abort_if_not(X >= -128.f && X <= 128.f) VAL [\old(cond)=1] [L8] COND FALSE !(!cond) VAL [\old(cond)=1] [L23] RET assume_abort_if_not(X >= -128.f && X <= 128.f) VAL [i=0] [L24] CALL assume_abort_if_not(D >= 0.f && D <= 16.f) VAL [\old(cond)=1] [L8] COND FALSE !(!cond) VAL [\old(cond)=1] [L24] RET assume_abort_if_not(D >= 0.f && D <= 16.f) VAL [i=0] [L26] S = Y [L27] Y = X [L28] R = X - S VAL [Y=54, i=0] [L29] COND TRUE R <= -D [L29] Y = S - D VAL [i=0] [L32] CALL __VERIFIER_assert(Y >= -129.f && Y <= 129.f) [L10] COND TRUE !(cond) [L10] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 2, 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, 23 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, 23 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 34 SizeOfPredicates, 0 NumberOfNonLiveVariables, 54 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 6/8 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-02-05 12:46:56,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/rlim_invariant.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 d395d439ec4556dc83dba3523bab6fe5cf68ec358a108cd3824067669c5e9bc5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:46:58,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:46:58,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 12:46:58,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:46:58,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:46:58,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:46:58,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:46:58,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:46:58,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:46:58,244 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:46:58,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:46:58,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:46:58,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:46:58,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:46:58,245 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:46:58,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:46:58,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:46:58,245 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:46:58,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:46:58,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:46:58,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:46:58,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:46:58,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:46:58,246 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 12:46:58,246 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 12:46:58,246 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 12:46:58,246 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:46:58,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:46:58,247 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:46:58,247 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:46:58,247 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:46:58,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:46:58,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:46:58,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:46:58,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:46:58,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:46:58,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:46:58,247 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:46:58,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:46:58,247 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 12:46:58,247 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 12:46:58,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:46:58,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:46:58,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:46:58,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:46:58,247 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-jdk21/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 -> d395d439ec4556dc83dba3523bab6fe5cf68ec358a108cd3824067669c5e9bc5 [2025-02-05 12:46:58,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:46:58,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:46:58,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:46:58,501 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:46:58,502 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:46:58,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/rlim_invariant.c [2025-02-05 12:46:59,634 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fe26c100c/ed075cfa87f9425f844f90c9902f8b88/FLAGdb20fe928 [2025-02-05 12:46:59,820 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:46:59,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c [2025-02-05 12:46:59,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fe26c100c/ed075cfa87f9425f844f90c9902f8b88/FLAGdb20fe928 [2025-02-05 12:46:59,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fe26c100c/ed075cfa87f9425f844f90c9902f8b88 [2025-02-05 12:46:59,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:46:59,840 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:46:59,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:46:59,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:46:59,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:46:59,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:46:59" (1/1) ... [2025-02-05 12:46:59,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f7d56be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:59, skipping insertion in model container [2025-02-05 12:46:59,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:46:59" (1/1) ... [2025-02-05 12:46:59,854 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:46:59,950 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c[451,464] [2025-02-05 12:46:59,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:46:59,975 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:46:59,986 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c[451,464] [2025-02-05 12:46:59,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:47:00,001 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:47:00,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:47:00 WrapperNode [2025-02-05 12:47:00,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:47:00,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:47:00,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:47:00,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:47:00,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:47:00" (1/1) ... [2025-02-05 12:47:00,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:47:00" (1/1) ... [2025-02-05 12:47:00,025 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2025-02-05 12:47:00,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:47:00,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:47:00,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:47:00,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:47:00,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:47:00" (1/1) ... [2025-02-05 12:47:00,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:47:00" (1/1) ... [2025-02-05 12:47:00,033 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:47:00" (1/1) ... [2025-02-05 12:47:00,039 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-02-05 12:47:00,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:47:00" (1/1) ... [2025-02-05 12:47:00,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:47:00" (1/1) ... [2025-02-05 12:47:00,043 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:47:00" (1/1) ... [2025-02-05 12:47:00,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:47:00" (1/1) ... [2025-02-05 12:47:00,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:47:00" (1/1) ... [2025-02-05 12:47:00,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:47:00" (1/1) ... [2025-02-05 12:47:00,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:47:00,047 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:47:00,047 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:47:00,047 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:47:00,048 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:47:00" (1/1) ... [2025-02-05 12:47:00,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:47:00,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:47:00,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 12:47:00,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 12:47:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:47:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 12:47:00,090 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 12:47:00,091 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 12:47:00,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:47:00,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:47:00,143 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:47:00,145 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:47:00,383 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 12:47:00,383 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:47:00,389 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:47:00,389 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:47:00,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:47:00 BoogieIcfgContainer [2025-02-05 12:47:00,389 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:47:00,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:47:00,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:47:00,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:47:00,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:46:59" (1/3) ... [2025-02-05 12:47:00,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7965467b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:47:00, skipping insertion in model container [2025-02-05 12:47:00,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:47:00" (2/3) ... [2025-02-05 12:47:00,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7965467b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:47:00, skipping insertion in model container [2025-02-05 12:47:00,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:47:00" (3/3) ... [2025-02-05 12:47:00,396 INFO L128 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c [2025-02-05 12:47:00,406 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:47:00,407 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rlim_invariant.c that has 2 procedures, 20 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:47:00,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:47:00,451 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;@db1c947, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:47:00,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:47:00,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 12:47:00,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 12:47:00,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:47:00,461 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:47:00,461 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:47:00,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:47:00,465 INFO L85 PathProgramCache]: Analyzing trace with hash 941859775, now seen corresponding path program 1 times [2025-02-05 12:47:00,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:47:00,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690123250] [2025-02-05 12:47:00,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:47:00,474 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-02-05 12:47:00,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:47:00,476 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-05 12:47:00,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 12:47:00,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 12:47:00,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 12:47:00,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:47:00,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:47:00,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 12:47:00,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:47:00,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 12:47:00,574 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:47:00,574 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:47:00,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690123250] [2025-02-05 12:47:00,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690123250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:47:00,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:47:00,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:47:00,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013817333] [2025-02-05 12:47:00,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:47:00,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 12:47:00,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:47:00,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 12:47:00,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 12:47:00,594 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 12:47:00,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:47:00,602 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2025-02-05 12:47:00,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 12:47:00,604 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-02-05 12:47:00,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:47:00,608 INFO L225 Difference]: With dead ends: 38 [2025-02-05 12:47:00,608 INFO L226 Difference]: Without dead ends: 17 [2025-02-05 12:47:00,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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-02-05 12:47:00,612 INFO L435 NwaCegarLoop]: 23 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, 23 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-02-05 12:47:00,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 12:47:00,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-02-05 12:47:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-02-05 12:47:00,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 12:47:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2025-02-05 12:47:00,642 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 18 [2025-02-05 12:47:00,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:47:00,642 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-02-05 12:47:00,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 12:47:00,643 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2025-02-05 12:47:00,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 12:47:00,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:47:00,645 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:47:00,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 12:47:00,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-05 12:47:00,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:47:00,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:47:00,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1903700193, now seen corresponding path program 1 times [2025-02-05 12:47:00,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:47:00,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964505997] [2025-02-05 12:47:00,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:47:00,847 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-02-05 12:47:00,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:47:00,851 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-05 12:47:00,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 12:47:00,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-05 12:47:00,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 12:47:00,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:47:00,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:47:00,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 12:47:00,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:47:01,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 12:47:01,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:47:01,328 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:47:01,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964505997] [2025-02-05 12:47:01,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964505997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:47:01,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:47:01,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 12:47:01,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141397459] [2025-02-05 12:47:01,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:47:01,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 12:47:01,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:47:01,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 12:47:01,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-05 12:47:01,332 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 12:47:01,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:47:01,823 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2025-02-05 12:47:01,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 12:47:01,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-02-05 12:47:01,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:47:01,825 INFO L225 Difference]: With dead ends: 32 [2025-02-05 12:47:01,825 INFO L226 Difference]: Without dead ends: 30 [2025-02-05 12:47:01,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-05 12:47:01,825 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:47:01,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 38 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 12:47:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-05 12:47:01,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2025-02-05 12:47:01,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 12:47:01,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-02-05 12:47:01,830 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 18 [2025-02-05 12:47:01,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:47:01,830 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-02-05 12:47:01,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 12:47:01,831 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-02-05 12:47:01,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 12:47:01,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:47:01,831 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:47:01,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 12:47:02,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-05 12:47:02,035 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:47:02,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:47:02,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1117668265, now seen corresponding path program 1 times [2025-02-05 12:47:02,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:47:02,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827379898] [2025-02-05 12:47:02,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:47:02,036 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-02-05 12:47:02,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:47:02,038 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-05 12:47:02,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 12:47:02,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 12:47:02,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 12:47:02,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:47:02,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:47:02,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 12:47:02,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:47:02,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 12:47:02,484 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:47:02,484 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:47:02,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827379898] [2025-02-05 12:47:02,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827379898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:47:02,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:47:02,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 12:47:02,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36132465] [2025-02-05 12:47:02,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:47:02,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 12:47:02,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:47:02,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 12:47:02,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-05 12:47:02,485 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 12:47:02,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:47:02,973 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2025-02-05 12:47:02,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 12:47:02,976 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-02-05 12:47:02,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:47:02,977 INFO L225 Difference]: With dead ends: 34 [2025-02-05 12:47:02,977 INFO L226 Difference]: Without dead ends: 32 [2025-02-05 12:47:02,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-05 12:47:02,977 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:47:02,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 59 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 12:47:02,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-05 12:47:02,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2025-02-05 12:47:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 12:47:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2025-02-05 12:47:02,982 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2025-02-05 12:47:02,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:47:02,982 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2025-02-05 12:47:02,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 12:47:02,982 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2025-02-05 12:47:02,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 12:47:02,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:47:02,983 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:47:02,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-05 12:47:03,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-02-05 12:47:03,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:47:03,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:47:03,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1117698056, now seen corresponding path program 1 times [2025-02-05 12:47:03,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:47:03,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325282303] [2025-02-05 12:47:03,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:47:03,184 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-02-05 12:47:03,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:47:03,187 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-02-05 12:47:03,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 12:47:03,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 12:47:03,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 12:47:03,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:47:03,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:47:03,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 12:47:03,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:47:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 12:47:03,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:47:03,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 12:47:03,534 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:47:03,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325282303] [2025-02-05 12:47:03,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325282303] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 12:47:03,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:47:03,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2025-02-05 12:47:03,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944081849] [2025-02-05 12:47:03,534 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 12:47:03,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 12:47:03,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:47:03,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 12:47:03,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-05 12:47:03,535 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 12:47:03,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:47:03,918 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2025-02-05 12:47:03,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 12:47:03,919 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2025-02-05 12:47:03,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:47:03,919 INFO L225 Difference]: With dead ends: 34 [2025-02-05 12:47:03,919 INFO L226 Difference]: Without dead ends: 32 [2025-02-05 12:47:03,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-05 12:47:03,920 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:47:03,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 82 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 12:47:03,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-05 12:47:03,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2025-02-05 12:47:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 12:47:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2025-02-05 12:47:03,926 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2025-02-05 12:47:03,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:47:03,926 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2025-02-05 12:47:03,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 12:47:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2025-02-05 12:47:03,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 12:47:03,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:47:03,927 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-05 12:47:03,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-05 12:47:04,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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-02-05 12:47:04,129 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:47:04,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:47:04,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1597510202, now seen corresponding path program 1 times [2025-02-05 12:47:04,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:47:04,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141866974] [2025-02-05 12:47:04,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:47:04,130 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-02-05 12:47:04,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:47:04,131 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-02-05 12:47:04,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 12:47:04,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 12:47:04,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 12:47:04,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:47:04,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:47:04,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 12:47:04,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:47:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 12:47:41,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:48:29,131 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:48:29,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141866974] [2025-02-05 12:48:29,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141866974] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:48:29,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1529379297] [2025-02-05 12:48:29,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:48:29,132 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 12:48:29,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 12:48:29,134 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 12:48:29,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-02-05 12:48:29,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 12:48:29,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 12:48:29,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:48:29,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:48:29,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 12:48:29,476 INFO L279 TraceCheckSpWp]: Computing forward predicates...