./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.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/interpolation.c.v+cfa-reducer.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 a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:43:48,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:43:48,644 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:43:48,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:43:48,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:43:48,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:43:48,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:43:48,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:43:48,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:43:48,678 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:43:48,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:43:48,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:43:48,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:43:48,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:43:48,679 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:43:48,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:43:48,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:43:48,679 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:43:48,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:43:48,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:43:48,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:43:48,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:43:48,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:43:48,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:43:48,680 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:43:48,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:43:48,680 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:43:48,681 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:43:48,681 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:43:48,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:43:48,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:43:48,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:43:48,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:43:48,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:43:48,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:43:48,681 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:43:48,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:43:48,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:43:48,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:43:48,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:43:48,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:43:48,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:43:48,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:43:48,682 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 -> a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 [2025-02-05 12:43:48,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:43:48,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:43:48,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:43:48,994 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:43:48,995 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:43:48,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2025-02-05 12:43:50,351 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68b0d02c3/615c192b656e4f768a8f119099cf7d25/FLAG8dbdabfb0 [2025-02-05 12:43:50,617 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:43:50,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2025-02-05 12:43:50,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68b0d02c3/615c192b656e4f768a8f119099cf7d25/FLAG8dbdabfb0 [2025-02-05 12:43:50,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68b0d02c3/615c192b656e4f768a8f119099cf7d25 [2025-02-05 12:43:50,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:43:50,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:43:50,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:43:50,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:43:50,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:43:50,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:43:50" (1/1) ... [2025-02-05 12:43:50,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a6bd3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:50, skipping insertion in model container [2025-02-05 12:43:50,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:43:50" (1/1) ... [2025-02-05 12:43:50,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:43:50,832 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/interpolation.c.v+cfa-reducer.c[1314,1327] [2025-02-05 12:43:50,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:43:50,846 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:43:50,864 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/interpolation.c.v+cfa-reducer.c[1314,1327] [2025-02-05 12:43:50,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:43:50,878 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:43:50,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:50 WrapperNode [2025-02-05 12:43:50,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:43:50,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:43:50,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:43:50,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:43:50,886 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:43:50" (1/1) ... [2025-02-05 12:43:50,894 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:43:50" (1/1) ... [2025-02-05 12:43:50,910 INFO L138 Inliner]: procedures = 18, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 110 [2025-02-05 12:43:50,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:43:50,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:43:50,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:43:50,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:43:50,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:50" (1/1) ... [2025-02-05 12:43:50,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:50" (1/1) ... [2025-02-05 12:43:50,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:50" (1/1) ... [2025-02-05 12:43:50,930 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-02-05 12:43:50,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:50" (1/1) ... [2025-02-05 12:43:50,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:50" (1/1) ... [2025-02-05 12:43:50,937 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:50" (1/1) ... [2025-02-05 12:43:50,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:50" (1/1) ... [2025-02-05 12:43:50,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:50" (1/1) ... [2025-02-05 12:43:50,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:50" (1/1) ... [2025-02-05 12:43:50,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:43:50,941 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:43:50,942 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:43:50,942 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:43:50,942 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:50" (1/1) ... [2025-02-05 12:43:50,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:43:50,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:43:50,973 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:43:50,978 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:43:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:43:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:43:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 12:43:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 12:43:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 12:43:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-05 12:43:50,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-05 12:43:50,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-05 12:43:50,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:43:50,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:43:50,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-05 12:43:50,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-05 12:43:50,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-05 12:43:50,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 12:43:51,062 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:43:51,063 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:43:51,197 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;call ULTIMATE.dealloc(main_~#main__min~0#1.base, main_~#main__min~0#1.offset);havoc main_~#main__min~0#1.base, main_~#main__min~0#1.offset;call ULTIMATE.dealloc(main_~#main__max~0#1.base, main_~#main__max~0#1.offset);havoc main_~#main__max~0#1.base, main_~#main__max~0#1.offset; [2025-02-05 12:43:51,205 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-02-05 12:43:51,206 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:43:51,212 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:43:51,213 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:43:51,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:43:51 BoogieIcfgContainer [2025-02-05 12:43:51,213 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:43:51,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:43:51,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:43:51,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:43:51,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:43:50" (1/3) ... [2025-02-05 12:43:51,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2183717d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:43:51, skipping insertion in model container [2025-02-05 12:43:51,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:50" (2/3) ... [2025-02-05 12:43:51,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2183717d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:43:51, skipping insertion in model container [2025-02-05 12:43:51,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:43:51" (3/3) ... [2025-02-05 12:43:51,221 INFO L128 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+cfa-reducer.c [2025-02-05 12:43:51,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:43:51,232 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation.c.v+cfa-reducer.c that has 1 procedures, 18 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 12:43:51,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:43:51,299 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;@58f4e36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:43:51,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:43:51,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:43:51,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 12:43:51,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:43:51,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:43:51,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:43:51,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:43:51,315 INFO L85 PathProgramCache]: Analyzing trace with hash 687133173, now seen corresponding path program 1 times [2025-02-05 12:43:51,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:43:51,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230579156] [2025-02-05 12:43:51,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:43:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:43:51,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 12:43:51,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 12:43:51,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:43:51,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:43:51,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:43:51,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:43:51,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230579156] [2025-02-05 12:43:51,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230579156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:43:51,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:43:51,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 12:43:51,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269590529] [2025-02-05 12:43:51,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:43:51,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 12:43:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:43:51,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 12:43:51,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:43:51,618 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:43:51,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:43:51,663 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2025-02-05 12:43:51,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 12:43:51,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-05 12:43:51,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:43:51,674 INFO L225 Difference]: With dead ends: 25 [2025-02-05 12:43:51,675 INFO L226 Difference]: Without dead ends: 15 [2025-02-05 12:43:51,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:43:51,681 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:43:51,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 12:43:51,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-05 12:43:51,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-05 12:43:51,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:43:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-02-05 12:43:51,707 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2025-02-05 12:43:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:43:51,707 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-02-05 12:43:51,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:43:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2025-02-05 12:43:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 12:43:51,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:43:51,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:43:51,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:43:51,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:43:51,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:43:51,711 INFO L85 PathProgramCache]: Analyzing trace with hash 688116276, now seen corresponding path program 1 times [2025-02-05 12:43:51,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:43:51,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833477208] [2025-02-05 12:43:51,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:43:51,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:43:51,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 12:43:51,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 12:43:51,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:43:51,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:43:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:43:51,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:43:51,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833477208] [2025-02-05 12:43:51,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833477208] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:43:51,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:43:51,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:43:51,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34429764] [2025-02-05 12:43:51,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:43:51,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:43:51,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:43:51,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:43:51,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:43:51,819 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:43:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:43:51,839 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-02-05 12:43:51,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:43:51,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-05 12:43:51,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:43:51,840 INFO L225 Difference]: With dead ends: 33 [2025-02-05 12:43:51,840 INFO L226 Difference]: Without dead ends: 25 [2025-02-05 12:43:51,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:43:51,841 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:43:51,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 27 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 12:43:51,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-05 12:43:51,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2025-02-05 12:43:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:43:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-02-05 12:43:51,844 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2025-02-05 12:43:51,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:43:51,845 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-02-05 12:43:51,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:43:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2025-02-05 12:43:51,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 12:43:51,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:43:51,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:43:51,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:43:51,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:43:51,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:43:51,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1614661202, now seen corresponding path program 1 times [2025-02-05 12:43:51,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:43:51,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212822665] [2025-02-05 12:43:51,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:43:51,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:43:51,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 12:43:51,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 12:43:51,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:43:51,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 12:43:51,868 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 12:43:51,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 12:43:51,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 12:43:51,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:43:51,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 12:43:51,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 12:43:51,894 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 12:43:51,895 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 12:43:51,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:43:51,899 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-05 12:43:51,918 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 12:43:51,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 12:43:51 BoogieIcfgContainer [2025-02-05 12:43:51,922 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 12:43:51,923 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 12:43:51,923 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 12:43:51,923 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 12:43:51,924 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:43:51" (3/4) ... [2025-02-05 12:43:51,926 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 12:43:51,927 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 12:43:51,927 INFO L158 Benchmark]: Toolchain (without parser) took 1267.26ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 50.7MB in the end (delta: 60.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-05 12:43:51,928 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 12:43:51,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.37ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 100.1MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 12:43:51,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.37ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 12:43:51,929 INFO L158 Benchmark]: Boogie Preprocessor took 29.56ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 12:43:51,929 INFO L158 Benchmark]: IcfgBuilder took 271.48ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 85.1MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 12:43:51,929 INFO L158 Benchmark]: TraceAbstraction took 707.32ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 50.7MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 12:43:51,929 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 142.6MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 12:43:51,932 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.37ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 100.1MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.37ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 98.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.56ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 271.48ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 85.1MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 707.32ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 50.7MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 142.6MB. Free memory is still 50.7MB. 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: 51]: 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 22, overapproximation of someBinaryFLOATComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of to_real at line 18, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; [L12] int __return_125; VAL [__return_125=0, __return_main=0] [L15] int main__i; [L16] float main__z; [L17] float main__t; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L20] main__t = __VERIFIER_nondet_float() [L21] int main____CPAchecker_TMP_0; [L22] EXPR main__min[0] VAL [__return_125=0, __return_main=0] [L22] COND TRUE main__t >= (main__min[0]) [L24] EXPR main__max[4UL] VAL [__return_125=0, __return_main=0] [L24] COND TRUE main__t <= (main__max[4UL]) [L26] main____CPAchecker_TMP_0 = 1 VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__max={4:0}] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_125=0, __return_main=0, main__i=0, main__max={4:0}] [L31] COND TRUE main__i < 5UL [L33] EXPR main__max[main__i] VAL [__return_125=0, __return_main=0] [L33] COND TRUE main__t <= (main__max[main__i]) [L36] EXPR main__min[main__i] [L36] EXPR main__max[main__i] [L36] EXPR main__min[main__i] [L36] main__z = (main__t - (main__min[main__i])) / ((main__max[main__i]) - (main__min[main__i])) [L37] int main____CPAchecker_TMP_1; VAL [__return_125=0, __return_main=0, main__i=0, main__max={4:0}] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_125=0, __return_main=0, main__i=0, main__max={4:0}] [L64] main____CPAchecker_TMP_1 = 0 VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}] [L45] int __tmp_1; [L46] __tmp_1 = main____CPAchecker_TMP_1 [L47] int __VERIFIER_assert__cond; [L48] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_125=0, __return_main=0, main__i=0, main__max={4:0}] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_125=0, __return_main=0, main__i=0, main__max={4:0}] [L51] reach_error() VAL [__return_125=0, __return_main=0, main__i=0, main__max={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 35 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 8, 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, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 12:43:51,954 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/interpolation.c.v+cfa-reducer.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 a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:43:54,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:43:54,235 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:43:54,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:43:54,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:43:54,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:43:54,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:43:54,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:43:54,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:43:54,264 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:43:54,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:43:54,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:43:54,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:43:54,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:43:54,265 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:43:54,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:43:54,265 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:43:54,265 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:43:54,265 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:43:54,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:43:54,265 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:43:54,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:43:54,266 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:43:54,266 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 12:43:54,266 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 12:43:54,266 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 12:43:54,266 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:43:54,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:43:54,266 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:43:54,266 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:43:54,267 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:43:54,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:43:54,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:43:54,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:43:54,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:43:54,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:43:54,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:43:54,268 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:43:54,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:43:54,268 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 12:43:54,268 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 12:43:54,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:43:54,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:43:54,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:43:54,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:43:54,268 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 -> a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 [2025-02-05 12:43:54,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:43:54,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:43:54,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:43:54,573 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:43:54,573 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:43:54,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2025-02-05 12:43:55,877 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92032a7d6/532c43efd4634a058a3fab9b0ff53a37/FLAG25d8d437f [2025-02-05 12:43:56,112 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:43:56,113 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2025-02-05 12:43:56,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92032a7d6/532c43efd4634a058a3fab9b0ff53a37/FLAG25d8d437f [2025-02-05 12:43:56,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/92032a7d6/532c43efd4634a058a3fab9b0ff53a37 [2025-02-05 12:43:56,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:43:56,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:43:56,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:43:56,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:43:56,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:43:56,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:43:56" (1/1) ... [2025-02-05 12:43:56,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@592df117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:56, skipping insertion in model container [2025-02-05 12:43:56,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:43:56" (1/1) ... [2025-02-05 12:43:56,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:43:56,308 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/interpolation.c.v+cfa-reducer.c[1314,1327] [2025-02-05 12:43:56,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:43:56,327 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:43:56,348 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/interpolation.c.v+cfa-reducer.c[1314,1327] [2025-02-05 12:43:56,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:43:56,378 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:43:56,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:56 WrapperNode [2025-02-05 12:43:56,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:43:56,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:43:56,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:43:56,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:43:56,387 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:43:56" (1/1) ... [2025-02-05 12:43:56,400 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:43:56" (1/1) ... [2025-02-05 12:43:56,426 INFO L138 Inliner]: procedures = 19, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 111 [2025-02-05 12:43:56,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:43:56,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:43:56,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:43:56,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:43:56,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:56" (1/1) ... [2025-02-05 12:43:56,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:56" (1/1) ... [2025-02-05 12:43:56,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:56" (1/1) ... [2025-02-05 12:43:56,461 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-02-05 12:43:56,462 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:56" (1/1) ... [2025-02-05 12:43:56,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:56" (1/1) ... [2025-02-05 12:43:56,477 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:56" (1/1) ... [2025-02-05 12:43:56,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:56" (1/1) ... [2025-02-05 12:43:56,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:56" (1/1) ... [2025-02-05 12:43:56,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:56" (1/1) ... [2025-02-05 12:43:56,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:43:56,490 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:43:56,490 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:43:56,490 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:43:56,491 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:56" (1/1) ... [2025-02-05 12:43:56,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:43:56,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:43:56,523 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:43:56,529 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:43:56,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:43:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-05 12:43:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-05 12:43:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-05 12:43:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 12:43:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-05 12:43:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-05 12:43:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 12:43:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-05 12:43:56,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-05 12:43:56,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-05 12:43:56,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:43:56,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:43:56,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 12:43:56,631 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:43:56,633 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:43:59,226 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;call ULTIMATE.dealloc(main_~#main__min~0#1.base, main_~#main__min~0#1.offset);havoc main_~#main__min~0#1.base, main_~#main__min~0#1.offset;call ULTIMATE.dealloc(main_~#main__max~0#1.base, main_~#main__max~0#1.offset);havoc main_~#main__max~0#1.base, main_~#main__max~0#1.offset; [2025-02-05 12:43:59,237 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-05 12:43:59,237 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:43:59,244 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:43:59,244 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:43:59,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:43:59 BoogieIcfgContainer [2025-02-05 12:43:59,245 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:43:59,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:43:59,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:43:59,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:43:59,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:43:56" (1/3) ... [2025-02-05 12:43:59,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba4197e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:43:59, skipping insertion in model container [2025-02-05 12:43:59,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:43:56" (2/3) ... [2025-02-05 12:43:59,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba4197e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:43:59, skipping insertion in model container [2025-02-05 12:43:59,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:43:59" (3/3) ... [2025-02-05 12:43:59,254 INFO L128 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+cfa-reducer.c [2025-02-05 12:43:59,266 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:43:59,267 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation.c.v+cfa-reducer.c that has 1 procedures, 18 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 12:43:59,308 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:43:59,318 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;@6f34557f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:43:59,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:43:59,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:43:59,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 12:43:59,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:43:59,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:43:59,328 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:43:59,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:43:59,333 INFO L85 PathProgramCache]: Analyzing trace with hash 687133173, now seen corresponding path program 1 times [2025-02-05 12:43:59,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:43:59,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002611989] [2025-02-05 12:43:59,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:43:59,342 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:43:59,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:43:59,346 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:43:59,348 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:43:59,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 12:43:59,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 12:43:59,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:43:59,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:43:59,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 12:43:59,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:43:59,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:43:59,666 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:43:59,666 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:43:59,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002611989] [2025-02-05 12:43:59,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002611989] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:43:59,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:43:59,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:43:59,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485461433] [2025-02-05 12:43:59,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:43:59,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:43:59,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:43:59,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:43:59,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:43:59,692 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:44:02,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 12:44:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:44:02,657 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2025-02-05 12:44:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:44:02,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-05 12:44:02,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:44:02,664 INFO L225 Difference]: With dead ends: 32 [2025-02-05 12:44:02,664 INFO L226 Difference]: Without dead ends: 18 [2025-02-05 12:44:02,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:44:02,668 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:44:02,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 38 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 12:44:02,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-05 12:44:02,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-02-05 12:44:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:44:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-02-05 12:44:02,699 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2025-02-05 12:44:02,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:44:02,700 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-02-05 12:44:02,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:44:02,700 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2025-02-05 12:44:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 12:44:02,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:44:02,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:44:02,712 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:44:02,902 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:44:02,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:44:02,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:44:02,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1613678099, now seen corresponding path program 1 times [2025-02-05 12:44:02,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:44:02,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417029586] [2025-02-05 12:44:02,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:44:02,903 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:44:02,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:44:02,905 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:44:02,906 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:44:02,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 12:44:03,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 12:44:03,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:44:03,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:44:03,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:44:03,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:44:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:44:03,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:44:03,207 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:44:03,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417029586] [2025-02-05 12:44:03,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417029586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:44:03,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:44:03,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:44:03,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723193275] [2025-02-05 12:44:03,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:44:03,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:44:03,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:44:03,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:44:03,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:44:03,222 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:44:05,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 12:44:05,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:44:05,423 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2025-02-05 12:44:05,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:44:05,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-05 12:44:05,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:44:05,424 INFO L225 Difference]: With dead ends: 20 [2025-02-05 12:44:05,424 INFO L226 Difference]: Without dead ends: 16 [2025-02-05 12:44:05,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:44:05,425 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:44:05,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 12:44:05,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-05 12:44:05,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-02-05 12:44:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:44:05,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-02-05 12:44:05,428 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2025-02-05 12:44:05,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:44:05,428 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-02-05 12:44:05,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:44:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2025-02-05 12:44:05,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 12:44:05,428 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:44:05,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:44:05,438 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:44:05,629 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:44:05,629 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:44:05,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:44:05,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1614661202, now seen corresponding path program 1 times [2025-02-05 12:44:05,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:44:05,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450326807] [2025-02-05 12:44:05,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:44:05,630 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:44:05,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:44:05,633 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:44:05,634 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:44:05,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 12:44:05,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 12:44:05,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:44:05,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:44:05,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 12:44:05,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:44:07,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 12:44:07,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 86 [2025-02-05 12:44:07,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 51 [2025-02-05 12:44:42,328 WARN L286 SmtUtils]: Spent 13.12s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-05 12:44:44,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:44:44,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:44:44,750 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:44:44,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450326807] [2025-02-05 12:44:44,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450326807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:44:44,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:44:44,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 12:44:44,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023711428] [2025-02-05 12:44:44,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:44:44,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 12:44:44,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:44:44,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 12:44:44,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-05 12:44:44,752 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:44:48,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:44:50,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:44:52,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:44:55,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-05 12:44:58,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:45:02,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:45:06,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:45:10,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:45:14,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:45:18,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:45:22,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:45:26,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:45:30,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]