./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/interpolation2.c.v+nlh-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 b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:53:38,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:53:38,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:53:38,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:53:38,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:53:38,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:53:38,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:53:38,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:53:38,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:53:38,228 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:53:38,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:53:38,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:53:38,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:53:38,229 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:53:38,229 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:53:38,229 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:53:38,229 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:53:38,229 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:53:38,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:53:38,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:53:38,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:53:38,230 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:53:38,230 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:53:38,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:53:38,230 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:53:38,230 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:53:38,230 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:53:38,230 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:53:38,230 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:53:38,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:53:38,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:53:38,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:53:38,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:53:38,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:53:38,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:53:38,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:53:38,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:53:38,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:53:38,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:53:38,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:53:38,231 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:53:38,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:53:38,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:53:38,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:53:38,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:53:38,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:53:38,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:53:38,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:53:38,231 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 -> b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f [2025-01-09 00:53:38,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:53:38,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:53:38,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:53:38,495 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:53:38,495 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:53:38,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2025-01-09 00:53:39,628 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec1ece954/131af9b025324ee18a3e5c03c8959509/FLAG68f83b838 [2025-01-09 00:53:39,909 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:53:39,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2025-01-09 00:53:39,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec1ece954/131af9b025324ee18a3e5c03c8959509/FLAG68f83b838 [2025-01-09 00:53:39,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec1ece954/131af9b025324ee18a3e5c03c8959509 [2025-01-09 00:53:39,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:53:39,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:53:39,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:53:39,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:53:39,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:53:39,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:53:39" (1/1) ... [2025-01-09 00:53:39,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2c47ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:39, skipping insertion in model container [2025-01-09 00:53:39,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:53:39" (1/1) ... [2025-01-09 00:53:39,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:53:40,101 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/interpolation2.c.v+nlh-reducer.c[1463,1476] [2025-01-09 00:53:40,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:53:40,120 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:53:40,133 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/interpolation2.c.v+nlh-reducer.c[1463,1476] [2025-01-09 00:53:40,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:53:40,146 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:53:40,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:40 WrapperNode [2025-01-09 00:53:40,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:53:40,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:53:40,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:53:40,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:53:40,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:40" (1/1) ... [2025-01-09 00:53:40,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:40" (1/1) ... [2025-01-09 00:53:40,171 INFO L138 Inliner]: procedures = 18, calls = 78, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 201 [2025-01-09 00:53:40,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:53:40,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:53:40,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:53:40,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:53:40,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:40" (1/1) ... [2025-01-09 00:53:40,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:40" (1/1) ... [2025-01-09 00:53:40,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:40" (1/1) ... [2025-01-09 00:53:40,192 INFO L175 MemorySlicer]: Split 33 memory accesses to 5 slices as follows [2, 11, 6, 6, 8]. 33 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [2, 5, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0, 0]. [2025-01-09 00:53:40,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:40" (1/1) ... [2025-01-09 00:53:40,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:40" (1/1) ... [2025-01-09 00:53:40,198 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:40" (1/1) ... [2025-01-09 00:53:40,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:40" (1/1) ... [2025-01-09 00:53:40,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:40" (1/1) ... [2025-01-09 00:53:40,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:40" (1/1) ... [2025-01-09 00:53:40,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:40" (1/1) ... [2025-01-09 00:53:40,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:53:40,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:53:40,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:53:40,204 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:53:40,204 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:40" (1/1) ... [2025-01-09 00:53:40,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:53:40,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:53:40,233 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-01-09 00:53:40,236 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-01-09 00:53:40,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:53:40,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:53:40,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 00:53:40,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 00:53:40,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 00:53:40,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 00:53:40,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 00:53:40,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 00:53:40,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 00:53:40,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 00:53:40,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 00:53:40,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 00:53:40,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:53:40,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:53:40,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 00:53:40,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 00:53:40,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 00:53:40,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 00:53:40,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 00:53:40,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 00:53:40,310 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:53:40,312 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:53:40,487 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-01-09 00:53:40,488 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:53:40,494 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:53:40,494 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 00:53:40,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:53:40 BoogieIcfgContainer [2025-01-09 00:53:40,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:53:40,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:53:40,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:53:40,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:53:40,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:53:39" (1/3) ... [2025-01-09 00:53:40,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178bd77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:53:40, skipping insertion in model container [2025-01-09 00:53:40,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:40" (2/3) ... [2025-01-09 00:53:40,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178bd77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:53:40, skipping insertion in model container [2025-01-09 00:53:40,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:53:40" (3/3) ... [2025-01-09 00:53:40,501 INFO L128 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+nlh-reducer.c [2025-01-09 00:53:40,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:53:40,512 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation2.c.v+nlh-reducer.c that has 1 procedures, 25 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 00:53:40,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:53:40,553 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;@6cfd43e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:53:40,553 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:53:40,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 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-01-09 00:53:40,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 00:53:40,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:53:40,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:53:40,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:53:40,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:53:40,563 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2025-01-09 00:53:40,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:53:40,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191697376] [2025-01-09 00:53:40,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:53:40,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:53:40,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 00:53:40,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 00:53:40,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:53:40,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:53:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:53:40,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:53:40,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191697376] [2025-01-09 00:53:40,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191697376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:53:40,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:53:40,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 00:53:40,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913321695] [2025-01-09 00:53:40,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:53:40,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:53:40,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:53:40,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:53:40,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:53:40,837 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 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.6) internal successors, (13), 5 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-01-09 00:53:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:53:40,880 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2025-01-09 00:53:40,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:53:40,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-01-09 00:53:40,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:53:40,888 INFO L225 Difference]: With dead ends: 32 [2025-01-09 00:53:40,888 INFO L226 Difference]: Without dead ends: 22 [2025-01-09 00:53:40,891 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-01-09 00:53:40,895 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 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-01-09 00:53:40,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 00:53:40,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-09 00:53:40,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-09 00:53:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-01-09 00:53:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-01-09 00:53:40,920 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2025-01-09 00:53:40,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:53:40,920 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-01-09 00:53:40,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-01-09 00:53:40,920 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2025-01-09 00:53:40,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 00:53:40,920 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:53:40,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:53:40,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:53:40,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:53:40,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:53:40,921 INFO L85 PathProgramCache]: Analyzing trace with hash 792769235, now seen corresponding path program 1 times [2025-01-09 00:53:40,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:53:40,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236427800] [2025-01-09 00:53:40,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:53:40,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:53:40,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 00:53:40,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 00:53:40,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:53:40,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:53:40,950 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 00:53:40,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 00:53:40,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 00:53:40,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:53:40,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:53:40,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 00:53:40,972 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 00:53:40,974 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:53:40,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:53:40,977 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 00:53:41,000 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:53:41,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:53:41 BoogieIcfgContainer [2025-01-09 00:53:41,006 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:53:41,006 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:53:41,006 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:53:41,006 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:53:41,007 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:53:40" (3/4) ... [2025-01-09 00:53:41,009 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 00:53:41,010 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:53:41,010 INFO L158 Benchmark]: Toolchain (without parser) took 1067.62ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 49.1MB in the end (delta: 61.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-09 00:53:41,010 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:53:41,011 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.85ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 99.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 00:53:41,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.40ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 97.1MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 00:53:41,011 INFO L158 Benchmark]: Boogie Preprocessor took 30.39ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 95.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:53:41,011 INFO L158 Benchmark]: RCFGBuilder took 290.92ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 80.3MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 00:53:41,011 INFO L158 Benchmark]: TraceAbstraction took 510.01ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 49.1MB in the end (delta: 31.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 00:53:41,011 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 142.6MB. Free memory is still 49.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:53:41,012 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.85ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 99.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.40ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 97.1MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.39ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 95.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 290.92ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 80.3MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 510.01ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 49.1MB in the end (delta: 31.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 142.6MB. Free memory is still 49.1MB. 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: 53]: 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 34, overapproximation of someBinaryFLOATComparisonOperation at line 24, overapproximation of someBinaryFLOATComparisonOperation at line 26, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of to_real at line 18, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L1] int __return_main; [L12] int __return_136; VAL [__return_136=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] float main__org[5] = { 1, 5, -10, 30, 20 }; [L20] float main__org[5] = { 1, 5, -10, 30, 20 }; [L20] float main__org[5] = { 1, 5, -10, 30, 20 }; [L20] float main__org[5] = { 1, 5, -10, 30, 20 }; [L20] float main__org[5] = { 1, 5, -10, 30, 20 }; [L20] float main__org[5] = { 1, 5, -10, 30, 20 }; [L21] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L21] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L21] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L21] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L21] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L21] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L22] main__t = __VERIFIER_nondet_float() [L23] int main____CPAchecker_TMP_0; [L24] EXPR main__min[0] VAL [__return_136=0, __return_main=0] [L24] COND TRUE main__t >= (main__min[0]) [L26] EXPR main__max[4UL] VAL [__return_136=0, __return_main=0] [L26] COND TRUE main__t <= (main__max[4UL]) [L28] main____CPAchecker_TMP_0 = 1 VAL [__return_136=0, __return_main=0, main____CPAchecker_TMP_0=1, main__max={6:0}] [L29] COND TRUE main____CPAchecker_TMP_0 != 0 [L31] main__i = 0 VAL [__return_136=0, __return_main=0, main__i=0, main__max={6:0}] [L32] COND TRUE main__i < 5UL [L34] EXPR main__max[main__i] VAL [__return_136=0, __return_main=0] [L34] COND TRUE main__t <= (main__max[main__i]) [L38] EXPR main__org[main__i] [L38] EXPR main__slope[main__i] [L38] EXPR main__min[main__i] [L38] EXPR main__max[main__i] [L38] EXPR main__min[main__i] [L38] main__z = (main__org[main__i]) + (((main__slope[main__i]) * (main__t - (main__min[main__i]))) / ((main__max[main__i]) - (main__min[main__i]))) [L39] int main____CPAchecker_TMP_1; VAL [__return_136=0, __return_main=0, main__i=0, main__max={6:0}] [L40] COND FALSE !(main__z >= -10.0) VAL [__return_136=0, __return_main=0, main__i=0, main__max={6:0}] [L66] main____CPAchecker_TMP_1 = 0 VAL [__return_136=0, __return_main=0, main____CPAchecker_TMP_1=0, main__i=0, main__max={6:0}] [L47] int __tmp_1; [L48] __tmp_1 = main____CPAchecker_TMP_1 [L49] int __VERIFIER_assert__cond; [L50] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_136=0, __return_main=0, main__i=0, main__max={6:0}] [L51] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_136=0, __return_main=0, main__i=0, main__max={6:0}] [L53] reach_error() VAL [__return_136=0, __return_main=0, main__i=0, main__max={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 121 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 33 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 20 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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-01-09 00:53:41,026 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/interpolation2.c.v+nlh-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 b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:53:43,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:53:43,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 00:53:43,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:53:43,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:53:43,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:53:43,198 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:53:43,198 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:53:43,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:53:43,198 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:53:43,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:53:43,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:53:43,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:53:43,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:53:43,199 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:53:43,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:53:43,199 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:53:43,199 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:53:43,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:53:43,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:53:43,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:53:43,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:53:43,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:53:43,200 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 00:53:43,200 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 00:53:43,200 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 00:53:43,200 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:53:43,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:53:43,200 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:53:43,200 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:53:43,200 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:53:43,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:53:43,201 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:53:43,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:53:43,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:53:43,201 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:53:43,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:53:43,201 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:53:43,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:53:43,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:53:43,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:53:43,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:53:43,201 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:53:43,201 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:53:43,201 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 00:53:43,201 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 00:53:43,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:53:43,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:53:43,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:53:43,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:53:43,201 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 -> b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f [2025-01-09 00:53:43,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:53:43,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:53:43,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:53:43,459 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:53:43,459 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:53:43,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2025-01-09 00:53:44,623 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50be84176/707e21219e444d3d9e285d20db8e1218/FLAGe4b8af79e [2025-01-09 00:53:44,870 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:53:44,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2025-01-09 00:53:44,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50be84176/707e21219e444d3d9e285d20db8e1218/FLAGe4b8af79e [2025-01-09 00:53:45,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50be84176/707e21219e444d3d9e285d20db8e1218 [2025-01-09 00:53:45,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:53:45,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:53:45,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:53:45,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:53:45,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:53:45,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:53:45" (1/1) ... [2025-01-09 00:53:45,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24230f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:45, skipping insertion in model container [2025-01-09 00:53:45,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:53:45" (1/1) ... [2025-01-09 00:53:45,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:53:45,343 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/interpolation2.c.v+nlh-reducer.c[1463,1476] [2025-01-09 00:53:45,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:53:45,362 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:53:45,377 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/interpolation2.c.v+nlh-reducer.c[1463,1476] [2025-01-09 00:53:45,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:53:45,391 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:53:45,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:45 WrapperNode [2025-01-09 00:53:45,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:53:45,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:53:45,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:53:45,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:53:45,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:45" (1/1) ... [2025-01-09 00:53:45,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:45" (1/1) ... [2025-01-09 00:53:45,431 INFO L138 Inliner]: procedures = 19, calls = 78, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 202 [2025-01-09 00:53:45,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:53:45,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:53:45,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:53:45,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:53:45,442 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:45" (1/1) ... [2025-01-09 00:53:45,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:45" (1/1) ... [2025-01-09 00:53:45,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:45" (1/1) ... [2025-01-09 00:53:45,468 INFO L175 MemorySlicer]: Split 33 memory accesses to 5 slices as follows [2, 6, 8, 6, 11]. 33 percent of accesses are in the largest equivalence class. The 22 initializations are split as follows [2, 5, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0, 0]. [2025-01-09 00:53:45,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:45" (1/1) ... [2025-01-09 00:53:45,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:45" (1/1) ... [2025-01-09 00:53:45,480 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:45" (1/1) ... [2025-01-09 00:53:45,484 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:45" (1/1) ... [2025-01-09 00:53:45,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:45" (1/1) ... [2025-01-09 00:53:45,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:45" (1/1) ... [2025-01-09 00:53:45,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:45" (1/1) ... [2025-01-09 00:53:45,503 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:53:45,504 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:53:45,504 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:53:45,504 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:53:45,505 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:45" (1/1) ... [2025-01-09 00:53:45,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:53:45,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:53:45,535 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-01-09 00:53:45,537 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-01-09 00:53:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:53:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 00:53:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 00:53:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 00:53:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 00:53:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 00:53:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 00:53:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 00:53:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 00:53:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 00:53:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 00:53:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 00:53:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 00:53:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 00:53:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 00:53:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 00:53:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 00:53:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:53:45,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:53:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 00:53:45,626 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:53:45,627 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:53:50,287 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-09 00:53:50,288 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:53:50,298 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:53:50,298 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 00:53:50,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:53:50 BoogieIcfgContainer [2025-01-09 00:53:50,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:53:50,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:53:50,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:53:50,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:53:50,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:53:45" (1/3) ... [2025-01-09 00:53:50,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196e923f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:53:50, skipping insertion in model container [2025-01-09 00:53:50,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:45" (2/3) ... [2025-01-09 00:53:50,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196e923f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:53:50, skipping insertion in model container [2025-01-09 00:53:50,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:53:50" (3/3) ... [2025-01-09 00:53:50,307 INFO L128 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+nlh-reducer.c [2025-01-09 00:53:50,318 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:53:50,320 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation2.c.v+nlh-reducer.c that has 1 procedures, 25 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 00:53:50,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:53:50,373 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;@40fee3c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:53:50,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:53:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 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-01-09 00:53:50,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 00:53:50,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:53:50,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:53:50,381 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:53:50,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:53:50,385 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2025-01-09 00:53:50,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:53:50,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11798274] [2025-01-09 00:53:50,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:53:50,392 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-01-09 00:53:50,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:53:50,395 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-01-09 00:53:50,397 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-01-09 00:53:50,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 00:53:50,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 00:53:50,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:53:50,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:53:50,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:53:50,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:53:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:53:50,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:53:50,921 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 00:53:50,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11798274] [2025-01-09 00:53:50,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11798274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:53:50,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:53:50,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:53:50,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745204430] [2025-01-09 00:53:50,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:53:50,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:53:50,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 00:53:50,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:53:50,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:53:50,938 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 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 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-01-09 00:53:55,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 00:53:55,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:53:55,238 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2025-01-09 00:53:55,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:53:55,240 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-01-09 00:53:55,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:53:55,244 INFO L225 Difference]: With dead ends: 32 [2025-01-09 00:53:55,245 INFO L226 Difference]: Without dead ends: 22 [2025-01-09 00:53:55,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:53:55,248 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:53:55,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 00:53:55,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-09 00:53:55,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-09 00:53:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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-01-09 00:53:55,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-01-09 00:53:55,266 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2025-01-09 00:53:55,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:53:55,267 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-01-09 00:53:55,267 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-01-09 00:53:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2025-01-09 00:53:55,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 00:53:55,267 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:53:55,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:53:55,281 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-01-09 00:53:55,468 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-01-09 00:53:55,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:53:55,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:53:55,468 INFO L85 PathProgramCache]: Analyzing trace with hash 792769235, now seen corresponding path program 1 times [2025-01-09 00:53:55,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:53:55,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053556713] [2025-01-09 00:53:55,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:53:55,469 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-01-09 00:53:55,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:53:55,471 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-01-09 00:53:55,472 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-01-09 00:53:55,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 00:53:55,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 00:53:55,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:53:55,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:53:55,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 00:53:55,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:53:59,294 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 153 treesize of output 105 [2025-01-09 00:53:59,317 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 108 treesize of output 84 [2025-01-09 00:53:59,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 00:53:59,406 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 140 treesize of output 92 [2025-01-09 00:53:59,428 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 84 treesize of output 60 [2025-01-09 00:54:11,499 WARN L286 SmtUtils]: Spent 7.34s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 00:54:22,713 WARN L286 SmtUtils]: Spent 5.53s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 00:54:29,497 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_3 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_18| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse0) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~main__t~0#1_18| .cse3)) (fp.sub c_currentRoundingMode .cse0 .cse3)))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse2) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_18| .cse0) (fp.geq |v_ULTIMATE.start_main_~main__t~0#1_18| .cse3) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2025-01-09 00:54:41,636 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 00:54:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:54:43,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:54:43,215 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 00:54:43,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053556713] [2025-01-09 00:54:43,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053556713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:54:43,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:54:43,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 00:54:43,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378759096] [2025-01-09 00:54:43,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:54:43,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 00:54:43,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 00:54:43,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 00:54:43,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=47, Unknown=1, NotChecked=14, Total=90 [2025-01-09 00:54:43,217 INFO L87 Difference]: Start difference. First operand 22 states and 27 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-01-09 00:54:47,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 00:54:51,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 00:54:54,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 00:54:57,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 00:55:02,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 00:55:02,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:55:02,929 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2025-01-09 00:55:02,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 00:55:02,930 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 13 [2025-01-09 00:55:02,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:55:02,931 INFO L225 Difference]: With dead ends: 35 [2025-01-09 00:55:02,931 INFO L226 Difference]: Without dead ends: 30 [2025-01-09 00:55:02,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=28, Invalid=47, Unknown=1, NotChecked=14, Total=90 [2025-01-09 00:55:02,931 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:55:02,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 51 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 3 Unknown, 37 Unchecked, 19.7s Time] [2025-01-09 00:55:02,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-09 00:55:02,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2025-01-09 00:55:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 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-01-09 00:55:02,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-01-09 00:55:02,934 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 13 [2025-01-09 00:55:02,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:55:02,934 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-01-09 00:55:02,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-01-09 00:55:02,934 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-01-09 00:55:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 00:55:02,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:55:02,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:55:02,947 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 00:55:03,135 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-01-09 00:55:03,135 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:55:03,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:55:03,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1710804433, now seen corresponding path program 1 times [2025-01-09 00:55:03,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:55:03,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390347159] [2025-01-09 00:55:03,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:55:03,136 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-01-09 00:55:03,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:55:03,138 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-01-09 00:55:03,138 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-01-09 00:55:03,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 00:55:03,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 00:55:03,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:55:03,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:55:03,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 00:55:03,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:55:07,094 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 153 treesize of output 105 [2025-01-09 00:55:07,116 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 108 treesize of output 84 [2025-01-09 00:55:07,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 00:55:07,223 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 140 treesize of output 92 [2025-01-09 00:55:07,243 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 84 treesize of output 60 [2025-01-09 00:55:19,616 WARN L286 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)