./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-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+cfa-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4b21fc033f5ea5cebc3419535848f3ce92b08a7177da8a580c018ae56dea99e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:53:25,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:53:26,022 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:26,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:53:26,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:53:26,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:53:26,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:53:26,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:53:26,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:53:26,048 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:53:26,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:53:26,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:53:26,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:53:26,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:53:26,050 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:53:26,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:53:26,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:53:26,050 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:53:26,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:53:26,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:53:26,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:53:26,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:53:26,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:53:26,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:53:26,051 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:53:26,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:53:26,051 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:53:26,051 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:53:26,051 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:53:26,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:53:26,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:53:26,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:53:26,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:53:26,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:53:26,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:53:26,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:53:26,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:53:26,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:53:26,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:53:26,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:53:26,052 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:53:26,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:53:26,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:53:26,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:53:26,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:53:26,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:53:26,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:53:26,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:53:26,052 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 -> a4b21fc033f5ea5cebc3419535848f3ce92b08a7177da8a580c018ae56dea99e [2025-01-09 00:53:26,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:53:26,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:53:26,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:53:26,300 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:53:26,300 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:53:26,301 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+cfa-reducer.c [2025-01-09 00:53:27,497 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30ad9d162/e0f9f28c643d4f6c82dfdd02ed9da0e5/FLAGc1adc5bd5 [2025-01-09 00:53:27,720 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:53:27,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c [2025-01-09 00:53:27,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30ad9d162/e0f9f28c643d4f6c82dfdd02ed9da0e5/FLAGc1adc5bd5 [2025-01-09 00:53:27,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/30ad9d162/e0f9f28c643d4f6c82dfdd02ed9da0e5 [2025-01-09 00:53:27,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:53:27,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:53:27,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:53:27,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:53:27,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:53:27,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:53:27" (1/1) ... [2025-01-09 00:53:27,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c4ca94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:27, skipping insertion in model container [2025-01-09 00:53:27,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:53:27" (1/1) ... [2025-01-09 00:53:27,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:53:27,888 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+cfa-reducer.c[1463,1476] [2025-01-09 00:53:27,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:53:27,903 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:53:27,920 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+cfa-reducer.c[1463,1476] [2025-01-09 00:53:27,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:53:27,940 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:53:27,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:27 WrapperNode [2025-01-09 00:53:27,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:53:27,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:53:27,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:53:27,941 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:53:27,947 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:27" (1/1) ... [2025-01-09 00:53:27,957 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:27" (1/1) ... [2025-01-09 00:53:27,974 INFO L138 Inliner]: procedures = 18, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 150 [2025-01-09 00:53:27,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:53:27,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:53:27,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:53:27,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:53:27,981 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:27" (1/1) ... [2025-01-09 00:53:27,981 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:27" (1/1) ... [2025-01-09 00:53:27,984 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:27" (1/1) ... [2025-01-09 00:53:27,996 INFO L175 MemorySlicer]: Split 30 memory accesses to 5 slices as follows [2, 8, 6, 8, 6]. 27 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:27,996 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:27" (1/1) ... [2025-01-09 00:53:27,996 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:27" (1/1) ... [2025-01-09 00:53:28,003 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:27" (1/1) ... [2025-01-09 00:53:28,007 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:27" (1/1) ... [2025-01-09 00:53:28,008 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:27" (1/1) ... [2025-01-09 00:53:28,009 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:27" (1/1) ... [2025-01-09 00:53:28,011 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:27" (1/1) ... [2025-01-09 00:53:28,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:53:28,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:53:28,016 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:53:28,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:53:28,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:27" (1/1) ... [2025-01-09 00:53:28,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:53:28,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:53:28,044 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:28,050 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:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:53:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:53:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 00:53:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 00:53:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 00:53:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 00:53:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 00:53:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 00:53:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 00:53:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 00:53:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 00:53:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 00:53:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:53:28,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:53:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 00:53:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 00:53:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 00:53:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 00:53:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 00:53:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 00:53:28,140 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:53:28,142 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:53:28,261 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-09 00:53:28,262 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:53:28,267 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:53:28,268 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 00:53:28,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:53:28 BoogieIcfgContainer [2025-01-09 00:53:28,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:53:28,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:53:28,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:53:28,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:53:28,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:53:27" (1/3) ... [2025-01-09 00:53:28,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecc04f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:53:28, skipping insertion in model container [2025-01-09 00:53:28,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:27" (2/3) ... [2025-01-09 00:53:28,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecc04f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:53:28, skipping insertion in model container [2025-01-09 00:53:28,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:53:28" (3/3) ... [2025-01-09 00:53:28,275 INFO L128 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+cfa-reducer.c [2025-01-09 00:53:28,284 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:53:28,287 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation2.c.v+cfa-reducer.c that has 1 procedures, 18 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 00:53:28,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:53:28,332 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;@64980953, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:53:28,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:53:28,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:53:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 00:53:28,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:53:28,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:53:28,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:53:28,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:53:28,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2025-01-09 00:53:28,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:53:28,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740397987] [2025-01-09 00:53:28,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:53:28,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:53:28,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 00:53:28,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 00:53:28,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:53:28,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:53:28,587 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:28,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:53:28,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740397987] [2025-01-09 00:53:28,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740397987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:53:28,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:53:28,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 00:53:28,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754287942] [2025-01-09 00:53:28,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:53:28,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:53:28,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:53:28,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:53:28,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:53:28,613 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:53:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:53:28,651 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2025-01-09 00:53:28,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:53:28,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 00:53:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:53:28,657 INFO L225 Difference]: With dead ends: 25 [2025-01-09 00:53:28,658 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 00:53:28,660 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:28,663 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:53:28,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 00:53:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 00:53:28,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-01-09 00:53:28,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:53:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-01-09 00:53:28,683 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2025-01-09 00:53:28,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:53:28,684 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-01-09 00:53:28,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:53:28,684 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2025-01-09 00:53:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 00:53:28,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:53:28,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:53:28,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:53:28,685 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:53:28,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:53:28,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1736001843, now seen corresponding path program 1 times [2025-01-09 00:53:28,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:53:28,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423934279] [2025-01-09 00:53:28,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:53:28,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:53:28,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 00:53:28,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 00:53:28,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:53:28,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:53:28,783 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:28,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:53:28,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423934279] [2025-01-09 00:53:28,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423934279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:53:28,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:53:28,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:53:28,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323971534] [2025-01-09 00:53:28,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:53:28,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:53:28,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:53:28,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:53:28,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:53:28,790 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:53:28,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:53:28,809 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-01-09 00:53:28,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:53:28,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 00:53:28,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:53:28,810 INFO L225 Difference]: With dead ends: 33 [2025-01-09 00:53:28,810 INFO L226 Difference]: Without dead ends: 25 [2025-01-09 00:53:28,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:53:28,811 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:53:28,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 27 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 00:53:28,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-09 00:53:28,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2025-01-09 00:53:28,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:53:28,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-01-09 00:53:28,815 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2025-01-09 00:53:28,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:53:28,815 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-01-09 00:53:28,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:53:28,815 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2025-01-09 00:53:28,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 00:53:28,815 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:53:28,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:53:28,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:53:28,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:53:28,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:53:28,816 INFO L85 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2025-01-09 00:53:28,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:53:28,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688763541] [2025-01-09 00:53:28,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:53:28,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:53:28,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 00:53:28,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 00:53:28,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:53:28,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:53:28,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 00:53:28,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 00:53:28,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 00:53:28,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:53:28,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 00:53:28,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 00:53:28,877 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 00:53:28,877 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:53:28,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:53:28,880 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 00:53:28,902 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:53:28,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:53:28 BoogieIcfgContainer [2025-01-09 00:53:28,905 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:53:28,906 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:53:28,906 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:53:28,907 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:53:28,908 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:28" (3/4) ... [2025-01-09 00:53:28,909 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 00:53:28,910 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:53:28,911 INFO L158 Benchmark]: Toolchain (without parser) took 1164.72ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 45.8MB in the end (delta: 67.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-09 00:53:28,911 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:53:28,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.64ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 101.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 00:53:28,913 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.69ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:53:28,913 INFO L158 Benchmark]: Boogie Preprocessor took 37.08ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 97.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 00:53:28,913 INFO L158 Benchmark]: RCFGBuilder took 255.23ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 84.9MB in the end (delta: 12.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:53:28,913 INFO L158 Benchmark]: TraceAbstraction took 635.47ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 46.3MB in the end (delta: 38.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 00:53:28,913 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 142.6MB. Free memory was 46.3MB in the beginning and 45.8MB in the end (delta: 527.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:53:28,916 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.68ms. Allocated memory is still 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.64ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 101.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.69ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.08ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 97.7MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 255.23ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 84.9MB in the end (delta: 12.8MB). There was no memory consumed. Max. memory is 16.1GB. * TraceAbstraction took 635.47ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 46.3MB in the end (delta: 38.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 142.6MB. Free memory was 46.3MB in the beginning and 45.8MB in the end (delta: 527.6kB). 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 24, overapproximation of someBinaryFLOATComparisonOperation at line 26, overapproximation of someBinaryFLOATComparisonOperation at line 35, 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_129; VAL [__return_129=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_129=0, __return_main=0] [L24] COND TRUE main__t >= (main__min[0]) [L26] EXPR main__max[4UL] VAL [__return_129=0, __return_main=0] [L26] COND TRUE main__t <= (main__max[4UL]) [L28] main____CPAchecker_TMP_0 = 1 VAL [__return_129=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_129=0, __return_main=0, main__i=0, main__max={6:0}] [L33] COND TRUE main__i < 5UL [L35] EXPR main__max[main__i] VAL [__return_129=0, __return_main=0] [L35] 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_129=0, __return_main=0, main__i=0, main__max={6:0}] [L40] COND FALSE !(main__z >= -10.0) VAL [__return_129=0, __return_main=0, main__i=0, main__max={6:0}] [L66] main____CPAchecker_TMP_1 = 0 VAL [__return_129=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_129=0, __return_main=0, main__i=0, main__max={6:0}] [L51] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_129=0, __return_main=0, main__i=0, main__max={6:0}] [L53] reach_error() VAL [__return_129=0, __return_main=0, main__i=0, main__max={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 35 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 00:53:28,931 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+cfa-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4b21fc033f5ea5cebc3419535848f3ce92b08a7177da8a580c018ae56dea99e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:53:30,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:53:30,867 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:30,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:53:30,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:53:30,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:53:30,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:53:30,897 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:53:30,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:53:30,897 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:53:30,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:53:30,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:53:30,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:53:30,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:53:30,898 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:53:30,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:53:30,899 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:53:30,899 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:53:30,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:53:30,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:53:30,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:53:30,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:53:30,900 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:53:30,900 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 00:53:30,900 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 00:53:30,900 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 00:53:30,900 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:53:30,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:53:30,900 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:53:30,900 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:53:30,900 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:53:30,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:53:30,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:53:30,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:53:30,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:53:30,901 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:53:30,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:53:30,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:53:30,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:53:30,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:53:30,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:53:30,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:53:30,902 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:53:30,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:53:30,902 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 00:53:30,902 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 00:53:30,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:53:30,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:53:30,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:53:30,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:53:30,902 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 -> a4b21fc033f5ea5cebc3419535848f3ce92b08a7177da8a580c018ae56dea99e [2025-01-09 00:53:31,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:53:31,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:53:31,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:53:31,135 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:53:31,136 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:53:31,137 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+cfa-reducer.c [2025-01-09 00:53:32,304 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a1c2fde7/e4ab90b2194441349f7ebc1d741581f8/FLAG4d74215f4 [2025-01-09 00:53:32,469 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:53:32,470 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c [2025-01-09 00:53:32,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a1c2fde7/e4ab90b2194441349f7ebc1d741581f8/FLAG4d74215f4 [2025-01-09 00:53:32,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a1c2fde7/e4ab90b2194441349f7ebc1d741581f8 [2025-01-09 00:53:32,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:53:32,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:53:32,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:53:32,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:53:32,498 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:53:32,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:53:32" (1/1) ... [2025-01-09 00:53:32,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c46db7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:32, skipping insertion in model container [2025-01-09 00:53:32,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:53:32" (1/1) ... [2025-01-09 00:53:32,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:53:32,639 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+cfa-reducer.c[1463,1476] [2025-01-09 00:53:32,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:53:32,660 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:53:32,684 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+cfa-reducer.c[1463,1476] [2025-01-09 00:53:32,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:53:32,702 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:53:32,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:32 WrapperNode [2025-01-09 00:53:32,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:53:32,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:53:32,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:53:32,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:53:32,709 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:32" (1/1) ... [2025-01-09 00:53:32,716 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:32" (1/1) ... [2025-01-09 00:53:32,730 INFO L138 Inliner]: procedures = 19, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 151 [2025-01-09 00:53:32,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:53:32,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:53:32,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:53:32,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:53:32,739 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:32" (1/1) ... [2025-01-09 00:53:32,740 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:32" (1/1) ... [2025-01-09 00:53:32,742 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:32" (1/1) ... [2025-01-09 00:53:32,760 INFO L175 MemorySlicer]: Split 30 memory accesses to 5 slices as follows [2, 6, 8, 8, 6]. 27 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:32,760 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:32" (1/1) ... [2025-01-09 00:53:32,760 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:32" (1/1) ... [2025-01-09 00:53:32,776 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:32" (1/1) ... [2025-01-09 00:53:32,777 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:32" (1/1) ... [2025-01-09 00:53:32,778 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:32" (1/1) ... [2025-01-09 00:53:32,779 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:32" (1/1) ... [2025-01-09 00:53:32,784 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:32" (1/1) ... [2025-01-09 00:53:32,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:53:32,789 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:53:32,789 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:53:32,789 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:53:32,790 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:32" (1/1) ... [2025-01-09 00:53:32,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:53:32,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:53:32,815 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:32,819 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:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:53:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 00:53:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 00:53:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 00:53:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 00:53:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 00:53:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 00:53:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 00:53:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 00:53:32,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 00:53:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 00:53:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 00:53:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 00:53:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 00:53:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 00:53:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 00:53:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 00:53:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:53:32,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:53:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 00:53:32,933 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:53:32,935 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:53:37,469 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-09 00:53:37,469 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:53:37,474 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:53:37,474 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 00:53:37,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:53:37 BoogieIcfgContainer [2025-01-09 00:53:37,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:53:37,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:53:37,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:53:37,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:53:37,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:53:32" (1/3) ... [2025-01-09 00:53:37,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd8dbcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:53:37, skipping insertion in model container [2025-01-09 00:53:37,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:53:32" (2/3) ... [2025-01-09 00:53:37,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd8dbcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:53:37, skipping insertion in model container [2025-01-09 00:53:37,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:53:37" (3/3) ... [2025-01-09 00:53:37,481 INFO L128 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+cfa-reducer.c [2025-01-09 00:53:37,491 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:53:37,492 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation2.c.v+cfa-reducer.c that has 1 procedures, 18 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 00:53:37,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:53:37,537 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;@7687cc92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:53:37,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:53:37,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:53:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 00:53:37,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:53:37,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:53:37,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:53:37,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:53:37,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2025-01-09 00:53:37,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:53:37,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897967380] [2025-01-09 00:53:37,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:53:37,559 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:37,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:53:37,562 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:37,563 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:37,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 00:53:37,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 00:53:37,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:53:37,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:53:37,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:53:37,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:53:37,962 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:37,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:53:37,963 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 00:53:37,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897967380] [2025-01-09 00:53:37,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897967380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:53:37,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:53:37,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:53:37,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237580799] [2025-01-09 00:53:37,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:53:37,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:53:37,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 00:53:37,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:53:37,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:53:37,980 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:53:42,191 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:46,195 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:53:50,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s 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:50,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:53:50,393 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2025-01-09 00:53:50,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:53:50,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 00:53:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:53:50,450 INFO L225 Difference]: With dead ends: 32 [2025-01-09 00:53:50,451 INFO L226 Difference]: Without dead ends: 18 [2025-01-09 00:53:50,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:53:50,453 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:53:50,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2025-01-09 00:53:50,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-09 00:53:50,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-01-09 00:53:50,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:53:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-01-09 00:53:50,473 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2025-01-09 00:53:50,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:53:50,473 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-01-09 00:53:50,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:53:50,474 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2025-01-09 00:53:50,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 00:53:50,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:53:50,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:53:50,485 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:50,675 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:50,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:53:50,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:53:50,675 INFO L85 PathProgramCache]: Analyzing trace with hash -859311250, now seen corresponding path program 1 times [2025-01-09 00:53:50,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:53:50,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002509635] [2025-01-09 00:53:50,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:53:50,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 00:53:50,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:53:50,678 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:50,679 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:50,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 00:53:50,998 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,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:53:50,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:53:51,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:53:51,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:53:51,121 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:51,122 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:53:51,122 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 00:53:51,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002509635] [2025-01-09 00:53:51,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002509635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:53:51,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:53:51,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:53:51,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723688746] [2025-01-09 00:53:51,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:53:51,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:53:51,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 00:53:51,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:53:51,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:53:51,124 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:53:55,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s 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,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:53:55,364 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2025-01-09 00:53:55,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:53:55,365 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,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:53:55,365 INFO L225 Difference]: With dead ends: 20 [2025-01-09 00:53:55,365 INFO L226 Difference]: Without dead ends: 16 [2025-01-09 00:53:55,365 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,366 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:53:55,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 00:53:55,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-01-09 00:53:55,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-01-09 00:53:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:53:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-01-09 00:53:55,367 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2025-01-09 00:53:55,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:53:55,368 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-01-09 00:53:55,368 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,368 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2025-01-09 00:53:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 00:53:55,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:53:55,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:53:55,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 00:53:55,568 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:53:55,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:53:55,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:53:55,569 INFO L85 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2025-01-09 00:53:55,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:53:55,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230214271] [2025-01-09 00:53:55,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:53:55,570 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,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:53:55,572 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:53:55,573 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:53:55,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 00:53:55,967 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,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:53:55,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:53:55,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 00:53:55,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:53:59,285 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,306 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,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 00:53:59,388 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,427 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:08,367 WARN L286 SmtUtils]: Spent 5.05s 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:21,629 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_4 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_12| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse3 (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 (_ bv4 32)) .cse0) (fp.geq |v_ULTIMATE.start_main_~main__t~0#1_12| .cse1) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~main__t~0#1_12| .cse1)) (fp.sub c_currentRoundingMode .cse2 .cse1)))) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_12| .cse2) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2025-01-09 00:54:28,394 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:28,394 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:54:28,394 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 00:54:28,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230214271] [2025-01-09 00:54:28,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230214271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:54:28,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:54:28,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 00:54:28,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690641263] [2025-01-09 00:54:28,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:54:28,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 00:54:28,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 00:54:28,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 00:54:28,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=47, Unknown=1, NotChecked=14, Total=90 [2025-01-09 00:54:28,395 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:54:32,823 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:54:35,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s 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:36,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:54:36,063 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-01-09 00:54:36,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 00:54:36,067 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:54:36,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:54:36,067 INFO L225 Difference]: With dead ends: 30 [2025-01-09 00:54:36,067 INFO L226 Difference]: Without dead ends: 25 [2025-01-09 00:54:36,068 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:54:36,068 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:54:36,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 56 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 1 Unknown, 30 Unchecked, 7.7s Time] [2025-01-09 00:54:36,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-01-09 00:54:36,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2025-01-09 00:54:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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:36,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2025-01-09 00:54:36,070 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2025-01-09 00:54:36,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:54:36,071 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-01-09 00:54:36,071 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:54:36,071 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2025-01-09 00:54:36,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 00:54:36,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:54:36,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:54:36,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 00:54:36,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 00:54:36,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:54:36,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:54:36,272 INFO L85 PathProgramCache]: Analyzing trace with hash -858361424, now seen corresponding path program 1 times [2025-01-09 00:54:36,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 00:54:36,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913581810] [2025-01-09 00:54:36,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:54:36,273 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:54:36,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 00:54:36,275 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 00:54:36,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 00:54:36,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 00:54:36,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 00:54:36,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:54:36,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:54:36,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 00:54:36,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:54:40,145 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:54:40,166 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:54:40,254 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 00:54:40,255 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:54:40,273 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:49,617 WARN L286 SmtUtils]: Spent 6.44s 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:55:03,192 WARN L286 SmtUtils]: Spent 6.39s 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:55:09,782 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~main__t~0#1_13| (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~main__t~0#1_13| .cse1)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)) .cse2) (fp.geq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse1) (fp.leq |v_ULTIMATE.start_main_~main__t~0#1_13| .cse0) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false