./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/floats-cdfpl/newton_3_7.i --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/newton_3_7.yml/witness.yml --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0a70ae82 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/floats-cdfpl/newton_3_7.i ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/newton_3_7.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-0a70ae8-m [2024-08-07 14:03:15,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-07 14:03:15,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-08-07 14:03:15,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-07 14:03:15,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-07 14:03:15,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-07 14:03:15,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-07 14:03:15,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-07 14:03:15,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-07 14:03:15,678 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-07 14:03:15,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-07 14:03:15,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-07 14:03:15,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-07 14:03:15,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-07 14:03:15,679 INFO L153 SettingsManager]: * Use SBE=true [2024-08-07 14:03:15,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-07 14:03:15,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-07 14:03:15,680 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-07 14:03:15,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-07 14:03:15,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-07 14:03:15,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-07 14:03:15,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-07 14:03:15,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-07 14:03:15,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-07 14:03:15,683 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-07 14:03:15,683 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-07 14:03:15,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-07 14:03:15,684 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-07 14:03:15,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-07 14:03:15,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-07 14:03:15,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-07 14:03:15,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-07 14:03:15,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-07 14:03:15,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-07 14:03:15,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-07 14:03:15,685 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-07 14:03:15,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-07 14:03:15,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-07 14:03:15,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-07 14:03:15,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-07 14:03:15,688 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-07 14:03:15,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-07 14:03:15,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-07 14:03:15,689 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-07 14:03:15,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-07 14:03:16,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-07 14:03:16,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-07 14:03:16,027 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-07 14:03:16,028 INFO L274 PluginConnector]: CDTParser initialized [2024-08-07 14:03:16,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-cdfpl/newton_3_7.i [2024-08-07 14:03:17,651 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-07 14:03:17,856 INFO L384 CDTParser]: Found 1 translation units. [2024-08-07 14:03:17,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-cdfpl/newton_3_7.i [2024-08-07 14:03:17,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc8cf13dd/4fc0fa1a6486416aa3fbcb241858e56e/FLAG22d973a83 [2024-08-07 14:03:17,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc8cf13dd/4fc0fa1a6486416aa3fbcb241858e56e [2024-08-07 14:03:17,889 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-07 14:03:17,890 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-07 14:03:17,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/newton_3_7.yml/witness.yml [2024-08-07 14:03:17,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-07 14:03:17,966 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-07 14:03:17,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-07 14:03:17,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-07 14:03:17,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-07 14:03:17,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:03:17" (1/2) ... [2024-08-07 14:03:17,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c7bc1ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:17, skipping insertion in model container [2024-08-07 14:03:17,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:03:17" (1/2) ... [2024-08-07 14:03:17,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@58c9145b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:17, skipping insertion in model container [2024-08-07 14:03:17,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:03:17" (2/2) ... [2024-08-07 14:03:17,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c7bc1ac and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:17, skipping insertion in model container [2024-08-07 14:03:17,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:03:17" (2/2) ... [2024-08-07 14:03:17,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-07 14:03:18,196 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cdfpl/newton_3_7.i[1764,1777] [2024-08-07 14:03:18,201 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:03:18,221 INFO L200 MainTranslator]: Completed pre-run [2024-08-07 14:03:18,243 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cdfpl/newton_3_7.i[1764,1777] [2024-08-07 14:03:18,245 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:03:18,272 INFO L204 MainTranslator]: Completed translation [2024-08-07 14:03:18,275 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:18 WrapperNode [2024-08-07 14:03:18,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-07 14:03:18,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-07 14:03:18,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-07 14:03:18,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-07 14:03:18,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:18" (1/1) ... [2024-08-07 14:03:18,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:18" (1/1) ... [2024-08-07 14:03:18,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:18" (1/1) ... [2024-08-07 14:03:18,316 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-07 14:03:18,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:18" (1/1) ... [2024-08-07 14:03:18,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:18" (1/1) ... [2024-08-07 14:03:18,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:18" (1/1) ... [2024-08-07 14:03:18,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:18" (1/1) ... [2024-08-07 14:03:18,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:18" (1/1) ... [2024-08-07 14:03:18,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-07 14:03:18,332 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-07 14:03:18,333 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-07 14:03:18,333 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-07 14:03:18,334 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:18" (1/1) ... [2024-08-07 14:03:18,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-07 14:03:18,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-07 14:03:18,368 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-07 14:03:18,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-07 14:03:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-07 14:03:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-07 14:03:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-07 14:03:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-07 14:03:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-08-07 14:03:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-08-07 14:03:18,419 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-07 14:03:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-07 14:03:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-07 14:03:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2024-08-07 14:03:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2024-08-07 14:03:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-07 14:03:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-07 14:03:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-07 14:03:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2024-08-07 14:03:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-08-07 14:03:18,421 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-08-07 14:03:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-07 14:03:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-07 14:03:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-07 14:03:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-07 14:03:18,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-07 14:03:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-07 14:03:18,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-07 14:03:18,502 INFO L273 CfgBuilder]: Building ICFG [2024-08-07 14:03:18,507 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-07 14:03:18,657 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-08-07 14:03:18,658 INFO L327 CfgBuilder]: Performing block encoding [2024-08-07 14:03:18,672 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-07 14:03:18,672 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-07 14:03:18,673 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:03:18 BoogieIcfgContainer [2024-08-07 14:03:18,673 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-07 14:03:18,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-07 14:03:18,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-07 14:03:18,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-07 14:03:18,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.08 02:03:17" (1/4) ... [2024-08-07 14:03:18,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b4183b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 02:03:18, skipping insertion in model container [2024-08-07 14:03:18,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:03:17" (2/4) ... [2024-08-07 14:03:18,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b4183b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 02:03:18, skipping insertion in model container [2024-08-07 14:03:18,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:18" (3/4) ... [2024-08-07 14:03:18,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b4183b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 02:03:18, skipping insertion in model container [2024-08-07 14:03:18,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:03:18" (4/4) ... [2024-08-07 14:03:18,686 INFO L119 eAbstractionObserver]: Analyzing ICFG newton_3_7.i [2024-08-07 14:03:18,686 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-07 14:03:18,709 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-07 14:03:18,709 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-07 14:03:18,764 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,765 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,766 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,766 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,767 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,767 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,769 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,769 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,770 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,770 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,772 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,772 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,774 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,774 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,787 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,787 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,789 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,789 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,790 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,791 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,792 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,792 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,793 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,793 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,794 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,795 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,796 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,796 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,803 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:18,804 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:18,804 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:18,805 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:18,806 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:18,806 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:18,809 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:18,809 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:18,810 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:18,810 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:18,812 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:18,812 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:18,812 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:18,813 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:18,817 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,819 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,820 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,821 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,822 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,822 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,823 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,823 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,824 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,824 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,828 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,829 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,829 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,829 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,830 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,830 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,830 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,830 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,831 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,831 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,831 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,831 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,832 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,832 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,833 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,833 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,844 INFO L90 WitnessUtils]: NestedWordAutomaton nwa = ( callAlphabet = {"call ULTIMATE.init();" "call #t~ret7 := fp(~x~0);" "call #t~ret6 := f(~x~0);" "call #t~ret5 := fp(~x~0);" "call #t~ret4 := f(~x~0);" "call #t~ret3 := fp(~IN~0);" "call #t~ret2 := f(~IN~0);" "call assume_abort_if_not((if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.4)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.4) then 1 else 0));" "call #t~ret8 := main();" }, internalAlphabet = {"~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0));" "assume true;" "assume 0 == ~cond;assume false;" "assume !(0 == ~cond);" "~cond := #in~cond;" "assume true;" "~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0));" "assume true;" "#res := 0;" "assume false;" "assume !false;" "assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);" "assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);" "~x~0 := ~someBinaryArithmeticFLOAToperation(~x~0, ~someBinaryArithmeticFLOAToperation(#t~ret6, #t~ret7));havoc #t~ret6;havoc #t~ret7;" "SUMMARY for call #t~ret7 := fp(~x~0); srcloc: L46-1" "SUMMARY for call #t~ret6 := f(~x~0); srcloc: L46-2" "~x~0 := ~someBinaryArithmeticFLOAToperation(~x~0, ~someBinaryArithmeticFLOAToperation(#t~ret4, #t~ret5));havoc #t~ret4;havoc #t~ret5;" "SUMMARY for call #t~ret5 := fp(~x~0); srcloc: L44-1" "SUMMARY for call #t~ret4 := f(~x~0); srcloc: L44-2" "~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3));havoc #t~ret2;havoc #t~ret3;" "SUMMARY for call #t~ret3 := fp(~IN~0); srcloc: L42-1" "SUMMARY for call #t~ret2 := f(~IN~0); srcloc: L42-2" "SUMMARY for call assume_abort_if_not((if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.4)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.4) then 1 else 0)); srcloc: L40" "havoc #t~nondet1;~IN~0 := #t~nondet1;havoc #t~nondet1;" "assume true;" "assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);" "assume true;" "SUMMARY for call #t~ret8 := main(); srcloc: L-1" "SUMMARY for call ULTIMATE.init(); srcloc: ULTIMATE.startENTRY" "assume true;" }, returnAlphabet = {"#48#return;" "#50#return;" "#34#return;" "#36#return;" "#38#return;" "#40#return;" "#42#return;" "#44#return;" "#46#return;" }, states = {"CountingPredicate [underlying: 22#fENTRYtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 29#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 22#fENTRYtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 14#fFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 27#fpEXITtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 16#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 6#fpFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 27#fpEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 10#L42-2true, annotation: [3, 0]]" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 27#fpEXITtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 22#fENTRYtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 10#L42-2true, annotation: [1, 0]]" "CountingPredicate [underlying: 25#assume_abort_if_notFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 29#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [17, 0]]" "CountingPredicate [underlying: 30#mainEXITtrue, annotation: [17, 0]]" "CountingPredicate [underlying: 30#mainEXITtrue, annotation: [15, 0]]" "CountingPredicate [underlying: 4#L46true, annotation: [1, 0]]" "CountingPredicate [underlying: 28#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 11#L51true, annotation: [1, 0]]" "CountingPredicate [underlying: 4#L46true, annotation: [15, 0]]" "CountingPredicate [underlying: 24#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 33#L24true, annotation: [1, 0]]" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 21#L44true, annotation: [11, 0]]" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 15#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 21#L44true, annotation: [1, 0]]" "CountingPredicate [underlying: 14#fFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 26#L46-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 19#L42-1true, annotation: [5, 0]]" "CountingPredicate [underlying: 34#L50true, annotation: [15, 0]]" "CountingPredicate [underlying: 9#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 19#L42-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 31#mainFINALtrue, annotation: [15, 0]]" "CountingPredicate [underlying: 22#fENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 31#mainFINALtrue, annotation: [17, 0]]" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 6#fpFINALtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 27#fpEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 13#L44-1true, annotation: [9, 0]]" "CountingPredicate [underlying: 5#L46-2true, annotation: [1, 0]]" "CountingPredicate [underlying: 34#L50true, annotation: [1, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [15, 0]]" "CountingPredicate [underlying: 25#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 31#mainFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 12#L40true, annotation: [0, 0]]" "CountingPredicate [underlying: 28#assume_abort_if_notEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 14#fFINALtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 17#L42true, annotation: [7, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [17, 0]]" "CountingPredicate [underlying: 13#L44-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 14#fFINALtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 26#L46-1true, annotation: [13, 0]]" "CountingPredicate [underlying: 5#L46-2true, annotation: [11, 0]]" "CountingPredicate [underlying: 17#L42true, annotation: [1, 0]]" "CountingPredicate [underlying: 35#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 18#mainENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 30#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 20#L53true, annotation: [1, 0]]" "CountingPredicate [underlying: 32#assume_abort_if_notENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 35#ULTIMATE.startFINALtrue, annotation: [17, 0]]" "CountingPredicate [underlying: 11#L51true, annotation: [16, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 35#ULTIMATE.startFINALtrue, annotation: [15, 0]]" "CountingPredicate [underlying: 6#fpFINALtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 20#L53true, annotation: [17, 0]]" "CountingPredicate [underlying: 23#L44-2true, annotation: [7, 0]]" "CountingPredicate [underlying: 20#L53true, annotation: [15, 0]]" "CountingPredicate [underlying: 6#fpFINALtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 23#L44-2true, annotation: [1, 0]]" }, initialStates = {"CountingPredicate [underlying: 16#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" }, finalStates = {"CountingPredicate [underlying: 29#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [17, 0]]" }, callTransitions = { ("CountingPredicate [underlying: 16#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "call ULTIMATE.init();" "CountingPredicate [underlying: 15#ULTIMATE.initENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 10#L42-2true, annotation: [3, 0]]" "call #t~ret2 := f(~IN~0);" "CountingPredicate [underlying: 22#fENTRYtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 10#L42-2true, annotation: [1, 0]]" "call #t~ret2 := f(~IN~0);" "CountingPredicate [underlying: 22#fENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 26#L46-1true, annotation: [1, 0]]" "call #t~ret7 := fp(~x~0);" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 19#L42-1true, annotation: [5, 0]]" "call #t~ret3 := fp(~IN~0);" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 19#L42-1true, annotation: [1, 0]]" "call #t~ret3 := fp(~IN~0);" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 13#L44-1true, annotation: [9, 0]]" "call #t~ret5 := fp(~x~0);" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 5#L46-2true, annotation: [1, 0]]" "call #t~ret6 := f(~x~0);" "CountingPredicate [underlying: 22#fENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 12#L40true, annotation: [0, 0]]" "call assume_abort_if_not((if ~someBinaryFLOATComparisonOperation(~IN~0, ~someUnaryFLOAToperation(1.4)) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.4) then 1 else 0));" "CountingPredicate [underlying: 32#assume_abort_if_notENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 13#L44-1true, annotation: [1, 0]]" "call #t~ret5 := fp(~x~0);" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 26#L46-1true, annotation: [13, 0]]" "call #t~ret7 := fp(~x~0);" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [14, 0]]") ("CountingPredicate [underlying: 5#L46-2true, annotation: [11, 0]]" "call #t~ret6 := f(~x~0);" "CountingPredicate [underlying: 22#fENTRYtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 23#L44-2true, annotation: [7, 0]]" "call #t~ret4 := f(~x~0);" "CountingPredicate [underlying: 22#fENTRYtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "call #t~ret8 := main();" "CountingPredicate [underlying: 18#mainENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 23#L44-2true, annotation: [1, 0]]" "call #t~ret4 := f(~x~0);" "CountingPredicate [underlying: 22#fENTRYtrue, annotation: [1, 0]]") }, internalTransitions = { ("CountingPredicate [underlying: 22#fENTRYtrue, annotation: [8, 0]]" "~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0));" "CountingPredicate [underlying: 14#fFINALtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 22#fENTRYtrue, annotation: [4, 0]]" "~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0));" "CountingPredicate [underlying: 14#fFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 14#fFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [6, 0]]" "~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0));" "CountingPredicate [underlying: 6#fpFINALtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 6#fpFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 27#fpEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [10, 0]]" "~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0));" "CountingPredicate [underlying: 6#fpFINALtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 22#fENTRYtrue, annotation: [12, 0]]" "~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0));" "CountingPredicate [underlying: 14#fFINALtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 25#assume_abort_if_notFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 28#assume_abort_if_notEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [14, 0]]" "~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0));" "CountingPredicate [underlying: 6#fpFINALtrue, annotation: [14, 0]]") ("CountingPredicate [underlying: 4#L46true, annotation: [1, 0]]" "~x~0 := ~someBinaryArithmeticFLOAToperation(~x~0, ~someBinaryArithmeticFLOAToperation(#t~ret6, #t~ret7));havoc #t~ret6;havoc #t~ret7;" "CountingPredicate [underlying: 34#L50true, annotation: [1, 0]]") ("CountingPredicate [underlying: 11#L51true, annotation: [1, 0]]" "assume false;" "CountingPredicate [underlying: 20#L53true, annotation: [1, 0]]") ("CountingPredicate [underlying: 11#L51true, annotation: [1, 0]]" "assume !false;" "CountingPredicate [underlying: 29#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 4#L46true, annotation: [15, 0]]" "~x~0 := ~someBinaryArithmeticFLOAToperation(~x~0, ~someBinaryArithmeticFLOAToperation(#t~ret6, #t~ret7));havoc #t~ret6;havoc #t~ret7;" "CountingPredicate [underlying: 34#L50true, annotation: [15, 0]]") ("CountingPredicate [underlying: 24#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 9#ULTIMATE.initEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 33#L24true, annotation: [1, 0]]" "assume 0 == ~cond;assume false;" "CountingPredicate [underlying: 25#assume_abort_if_notFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 33#L24true, annotation: [1, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 25#assume_abort_if_notFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 21#L44true, annotation: [11, 0]]" "~x~0 := ~someBinaryArithmeticFLOAToperation(~x~0, ~someBinaryArithmeticFLOAToperation(#t~ret4, #t~ret5));havoc #t~ret4;havoc #t~ret5;" "CountingPredicate [underlying: 5#L46-2true, annotation: [11, 0]]") ("CountingPredicate [underlying: 15#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);" "CountingPredicate [underlying: 24#ULTIMATE.initFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 21#L44true, annotation: [1, 0]]" "~x~0 := ~someBinaryArithmeticFLOAToperation(~x~0, ~someBinaryArithmeticFLOAToperation(#t~ret4, #t~ret5));havoc #t~ret4;havoc #t~ret5;" "CountingPredicate [underlying: 5#L46-2true, annotation: [1, 0]]") ("CountingPredicate [underlying: 14#fFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 34#L50true, annotation: [15, 0]]" "assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);" "CountingPredicate [underlying: 11#L51true, annotation: [16, 0]]") ("CountingPredicate [underlying: 34#L50true, annotation: [15, 0]]" "assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);" "CountingPredicate [underlying: 20#L53true, annotation: [15, 0]]") ("CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [1, 0]]" "~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), 720.0));" "CountingPredicate [underlying: 6#fpFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 31#mainFINALtrue, annotation: [15, 0]]" "assume true;" "CountingPredicate [underlying: 30#mainEXITtrue, annotation: [15, 0]]") ("CountingPredicate [underlying: 22#fENTRYtrue, annotation: [1, 0]]" "~x := #in~x;#res := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x, ~x), ~x), ~x), ~x), ~x), ~x), 5040.0));" "CountingPredicate [underlying: 14#fFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 31#mainFINALtrue, annotation: [17, 0]]" "assume true;" "CountingPredicate [underlying: 30#mainEXITtrue, annotation: [17, 0]]") ("CountingPredicate [underlying: 6#fpFINALtrue, annotation: [6, 0]]" "assume true;" "CountingPredicate [underlying: 27#fpEXITtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 34#L50true, annotation: [1, 0]]" "assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);" "CountingPredicate [underlying: 11#L51true, annotation: [1, 0]]") ("CountingPredicate [underlying: 34#L50true, annotation: [1, 0]]" "assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);" "CountingPredicate [underlying: 20#L53true, annotation: [1, 0]]") ("CountingPredicate [underlying: 25#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 28#assume_abort_if_notEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 31#mainFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 30#mainEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 14#fFINALtrue, annotation: [12, 0]]" "assume true;" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 17#L42true, annotation: [7, 0]]" "~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3));havoc #t~ret2;havoc #t~ret3;" "CountingPredicate [underlying: 23#L44-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 14#fFINALtrue, annotation: [8, 0]]" "assume true;" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 17#L42true, annotation: [1, 0]]" "~x~0 := ~someBinaryArithmeticFLOAToperation(~IN~0, ~someBinaryArithmeticFLOAToperation(#t~ret2, #t~ret3));havoc #t~ret2;havoc #t~ret3;" "CountingPredicate [underlying: 23#L44-2true, annotation: [1, 0]]") ("CountingPredicate [underlying: 35#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 18#mainENTRYtrue, annotation: [0, 0]]" "havoc #t~nondet1;~IN~0 := #t~nondet1;havoc #t~nondet1;" "CountingPredicate [underlying: 12#L40true, annotation: [0, 0]]") ("CountingPredicate [underlying: 20#L53true, annotation: [1, 0]]" "#res := 0;" "CountingPredicate [underlying: 31#mainFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 32#assume_abort_if_notENTRYtrue, annotation: [1, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 33#L24true, annotation: [1, 0]]") ("CountingPredicate [underlying: 35#ULTIMATE.startFINALtrue, annotation: [17, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [17, 0]]") ("CountingPredicate [underlying: 11#L51true, annotation: [16, 0]]" "assume false;" "CountingPredicate [underlying: 20#L53true, annotation: [17, 0]]") ("CountingPredicate [underlying: 11#L51true, annotation: [16, 0]]" "assume !false;" "CountingPredicate [underlying: 29#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [17, 0]]") ("CountingPredicate [underlying: 35#ULTIMATE.startFINALtrue, annotation: [15, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [15, 0]]") ("CountingPredicate [underlying: 6#fpFINALtrue, annotation: [10, 0]]" "assume true;" "CountingPredicate [underlying: 27#fpEXITtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 20#L53true, annotation: [17, 0]]" "#res := 0;" "CountingPredicate [underlying: 31#mainFINALtrue, annotation: [17, 0]]") ("CountingPredicate [underlying: 20#L53true, annotation: [15, 0]]" "#res := 0;" "CountingPredicate [underlying: 31#mainFINALtrue, annotation: [15, 0]]") ("CountingPredicate [underlying: 6#fpFINALtrue, annotation: [14, 0]]" "assume true;" "CountingPredicate [underlying: 27#fpEXITtrue, annotation: [14, 0]]") }, returnTransitions = { ("CountingPredicate [underlying: 27#fpEXITtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 26#L46-1true, annotation: [13, 0]]" "#34#return;" "CountingPredicate [underlying: 4#L46true, annotation: [15, 0]]") ("CountingPredicate [underlying: 27#fpEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 13#L44-1true, annotation: [9, 0]]" "#38#return;" "CountingPredicate [underlying: 21#L44true, annotation: [11, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 10#L42-2true, annotation: [3, 0]]" "#44#return;" "CountingPredicate [underlying: 19#L42-1true, annotation: [5, 0]]") ("CountingPredicate [underlying: 27#fpEXITtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 19#L42-1true, annotation: [5, 0]]" "#42#return;" "CountingPredicate [underlying: 17#L42true, annotation: [7, 0]]") ("CountingPredicate [underlying: 30#mainEXITtrue, annotation: [17, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 35#ULTIMATE.startFINALtrue, annotation: [17, 0]]") ("CountingPredicate [underlying: 30#mainEXITtrue, annotation: [15, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 35#ULTIMATE.startFINALtrue, annotation: [15, 0]]") ("CountingPredicate [underlying: 28#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 12#L40true, annotation: [0, 0]]" "#46#return;" "CountingPredicate [underlying: 10#L42-2true, annotation: [3, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 23#L44-2true, annotation: [7, 0]]" "#40#return;" "CountingPredicate [underlying: 13#L44-1true, annotation: [9, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 5#L46-2true, annotation: [11, 0]]" "#36#return;" "CountingPredicate [underlying: 26#L46-1true, annotation: [13, 0]]") ("CountingPredicate [underlying: 9#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 16#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "#50#return;" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 5#L46-2true, annotation: [1, 0]]" "#36#return;" "CountingPredicate [underlying: 26#L46-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 23#L44-2true, annotation: [1, 0]]" "#40#return;" "CountingPredicate [underlying: 13#L44-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 10#L42-2true, annotation: [1, 0]]" "#44#return;" "CountingPredicate [underlying: 19#L42-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 27#fpEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 26#L46-1true, annotation: [1, 0]]" "#34#return;" "CountingPredicate [underlying: 4#L46true, annotation: [1, 0]]") ("CountingPredicate [underlying: 27#fpEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 19#L42-1true, annotation: [1, 0]]" "#42#return;" "CountingPredicate [underlying: 17#L42true, annotation: [1, 0]]") ("CountingPredicate [underlying: 27#fpEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 13#L44-1true, annotation: [1, 0]]" "#38#return;" "CountingPredicate [underlying: 21#L44true, annotation: [1, 0]]") ("CountingPredicate [underlying: 28#assume_abort_if_notEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 12#L40true, annotation: [0, 0]]" "#46#return;" "CountingPredicate [underlying: 10#L42-2true, annotation: [1, 0]]") ("CountingPredicate [underlying: 30#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "#48#return;" "CountingPredicate [underlying: 35#ULTIMATE.startFINALtrue, annotation: [1, 0]]") } ); [2024-08-07 14:03:18,851 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-08-07 14:03:18,855 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,858 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,858 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,859 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,859 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,859 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,860 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,860 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,860 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,860 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,861 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,865 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,866 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,866 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,867 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,867 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,867 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,867 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,868 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,871 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,873 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,873 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,874 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,874 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,874 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,875 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,875 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,877 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,880 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:18,882 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:18,882 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:18,883 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:18,883 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:18,884 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:18,884 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:18,885 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:18,885 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:18,886 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:18,887 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:18,887 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:18,888 WARN L283 nessProductAutomaton]: assume !~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated false [2024-08-07 14:03:18,888 WARN L283 nessProductAutomaton]: assume !!~someBinaryDOUBLEComparisonOperation(~x~0, 0.1);, isNegated true [2024-08-07 14:03:18,888 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,890 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,890 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,890 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,891 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,891 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,892 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,892 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,893 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,893 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,893 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,893 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,894 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,894 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,895 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,895 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,896 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,896 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,896 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,897 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,897 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,897 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,897 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,898 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,898 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:18,898 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:18,905 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 76 states to 41 states. [2024-08-07 14:03:18,931 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-07 14:03:18,940 INFO L357 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, mHoare=false, 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;@66282915, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-07 14:03:18,940 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-07 14:03:18,942 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2024-08-07 14:03:18,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-08-07 14:03:18,949 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 14:03:18,950 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-07 14:03:18,950 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 14:03:18,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 14:03:18,957 INFO L85 PathProgramCache]: Analyzing trace with hash 109254668, now seen corresponding path program 1 times [2024-08-07 14:03:18,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-07 14:03:18,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675506090] [2024-08-07 14:03:18,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 14:03:18,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-07 14:03:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 14:03:19,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-07 14:03:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 14:03:19,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-07 14:03:19,134 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-07 14:03:19,135 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-07 14:03:19,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-07 14:03:19,141 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-07 14:03:19,146 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-07 14:03:19,170 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.08 02:03:19 BoogieIcfgContainer [2024-08-07 14:03:19,170 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-07 14:03:19,172 INFO L158 Benchmark]: Toolchain (without parser) took 1205.78ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 41.7MB in the beginning and 37.7MB in the end (delta: 4.0MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-08-07 14:03:19,172 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 48.2MB. Free memory was 24.7MB in the beginning and 24.6MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:03:19,172 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 67.1MB. Free memory is still 44.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:03:19,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.15ms. Allocated memory is still 67.1MB. Free memory was 41.5MB in the beginning and 47.5MB in the end (delta: -6.1MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2024-08-07 14:03:19,174 INFO L158 Benchmark]: Boogie Preprocessor took 54.90ms. Allocated memory is still 67.1MB. Free memory was 47.5MB in the beginning and 45.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-07 14:03:19,175 INFO L158 Benchmark]: IcfgBuilder took 340.20ms. Allocated memory is still 67.1MB. Free memory was 45.3MB in the beginning and 33.6MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-08-07 14:03:19,176 INFO L158 Benchmark]: TraceAbstraction took 493.71ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 32.9MB in the beginning and 37.7MB in the end (delta: -4.7MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-08-07 14:03:19,179 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.20ms. Allocated memory is still 48.2MB. Free memory was 24.7MB in the beginning and 24.6MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.21ms. Allocated memory is still 67.1MB. Free memory is still 44.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.15ms. Allocated memory is still 67.1MB. Free memory was 41.5MB in the beginning and 47.5MB in the end (delta: -6.1MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.90ms. Allocated memory is still 67.1MB. Free memory was 47.5MB in the beginning and 45.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 340.20ms. Allocated memory is still 67.1MB. Free memory was 45.3MB in the beginning and 33.6MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 493.71ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 32.9MB in the beginning and 37.7MB in the end (delta: -4.7MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 51]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryArithmeticFLOAToperation at line 46. Possible FailurePath: [L39] float IN = __VERIFIER_nondet_float(); [L40] CALL assume_abort_if_not(IN > -1.4f && IN < 1.4f) VAL [\old(cond)=1] [L24] !cond VAL [\old(cond)=1] [L40] RET assume_abort_if_not(IN > -1.4f && IN < 1.4f) [L42] CALL, EXPR f(IN) VAL [\old(x)=54] [L29] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=54] [L42] RET, EXPR f(IN) VAL [IN=54] [L42] CALL, EXPR fp(IN) VAL [\old(x)=54] [L34] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=54] [L42] RET, EXPR fp(IN) VAL [IN=54] [L42] float x = IN - f(IN)/fp(IN); [L44] CALL, EXPR f(x) VAL [\old(x)=55] [L29] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=55] [L44] RET, EXPR f(x) VAL [IN=54, x=55] [L44] CALL, EXPR fp(x) VAL [\old(x)=55] [L34] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=55] [L44] RET, EXPR fp(x) VAL [IN=54, x=55] [L44] x = x - f(x)/fp(x) [L46] CALL, EXPR f(x) VAL [\old(x)=53] [L29] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=53] [L46] RET, EXPR f(x) VAL [IN=54, x=53] [L46] CALL, EXPR fp(x) VAL [\old(x)=53] [L34] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=53] [L46] RET, EXPR fp(x) VAL [IN=54, x=53] [L46] x = x - f(x)/fp(x) [L50] !(x < 0.1) VAL [IN=54] [L51] reach_error() VAL [IN=54] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 1, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-08-07 14:03:19,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/floats-cdfpl/newton_3_7.i ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/newton_3_7.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-0a70ae8-m [2024-08-07 14:03:21,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-07 14:03:21,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-08-07 14:03:21,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-07 14:03:21,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-07 14:03:21,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-07 14:03:21,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-07 14:03:21,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-07 14:03:21,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-07 14:03:21,448 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-07 14:03:21,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-07 14:03:21,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-07 14:03:21,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-07 14:03:21,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-07 14:03:21,449 INFO L153 SettingsManager]: * Use SBE=true [2024-08-07 14:03:21,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-07 14:03:21,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-07 14:03:21,455 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-07 14:03:21,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-07 14:03:21,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-07 14:03:21,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-07 14:03:21,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-07 14:03:21,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-07 14:03:21,458 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-07 14:03:21,458 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-07 14:03:21,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-07 14:03:21,458 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-07 14:03:21,459 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-07 14:03:21,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-07 14:03:21,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-07 14:03:21,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-07 14:03:21,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-07 14:03:21,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-07 14:03:21,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-07 14:03:21,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-07 14:03:21,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-07 14:03:21,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-07 14:03:21,461 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-07 14:03:21,462 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-07 14:03:21,463 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-07 14:03:21,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-07 14:03:21,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-07 14:03:21,463 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-07 14:03:21,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-07 14:03:21,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-07 14:03:21,464 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-07 14:03:21,464 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-07 14:03:21,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-07 14:03:21,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-07 14:03:21,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-07 14:03:21,803 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-07 14:03:21,803 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-07 14:03:21,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/newton_3_7.yml/witness.yml [2024-08-07 14:03:21,889 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-07 14:03:21,891 INFO L274 PluginConnector]: CDTParser initialized [2024-08-07 14:03:21,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-cdfpl/newton_3_7.i [2024-08-07 14:03:23,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-07 14:03:23,777 INFO L384 CDTParser]: Found 1 translation units. [2024-08-07 14:03:23,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-cdfpl/newton_3_7.i [2024-08-07 14:03:23,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0458bf5a7/12421414421149568bfdeb613d18f4c7/FLAG8e809d677 [2024-08-07 14:03:24,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0458bf5a7/12421414421149568bfdeb613d18f4c7 [2024-08-07 14:03:24,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-07 14:03:24,148 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-07 14:03:24,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-07 14:03:24,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-07 14:03:24,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-07 14:03:24,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:03:21" (1/2) ... [2024-08-07 14:03:24,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33de0f15 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:24, skipping insertion in model container [2024-08-07 14:03:24,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:03:21" (1/2) ... [2024-08-07 14:03:24,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2f567b97 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:24, skipping insertion in model container [2024-08-07 14:03:24,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:03:24" (2/2) ... [2024-08-07 14:03:24,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33de0f15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:24, skipping insertion in model container [2024-08-07 14:03:24,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:03:24" (2/2) ... [2024-08-07 14:03:24,180 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-07 14:03:24,339 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cdfpl/newton_3_7.i[1764,1777] [2024-08-07 14:03:24,344 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:03:24,358 INFO L200 MainTranslator]: Completed pre-run [2024-08-07 14:03:24,377 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-cdfpl/newton_3_7.i[1764,1777] [2024-08-07 14:03:24,379 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:03:24,401 INFO L204 MainTranslator]: Completed translation [2024-08-07 14:03:24,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:24 WrapperNode [2024-08-07 14:03:24,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-07 14:03:24,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-07 14:03:24,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-07 14:03:24,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-07 14:03:24,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:24" (1/1) ... [2024-08-07 14:03:24,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:24" (1/1) ... [2024-08-07 14:03:24,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:24" (1/1) ... [2024-08-07 14:03:24,462 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-08-07 14:03:24,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:24" (1/1) ... [2024-08-07 14:03:24,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:24" (1/1) ... [2024-08-07 14:03:24,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:24" (1/1) ... [2024-08-07 14:03:24,483 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:24" (1/1) ... [2024-08-07 14:03:24,485 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:24" (1/1) ... [2024-08-07 14:03:24,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-07 14:03:24,495 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-07 14:03:24,495 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-07 14:03:24,495 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-07 14:03:24,496 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:24" (1/1) ... [2024-08-07 14:03:24,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-07 14:03:24,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-07 14:03:24,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-07 14:03:24,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-07 14:03:24,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-07 14:03:24,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-07 14:03:24,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2024-08-07 14:03:24,593 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-07 14:03:24,593 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-07 14:03:24,594 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-08-07 14:03:24,594 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-08-07 14:03:24,594 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-07 14:03:24,594 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-07 14:03:24,594 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-07 14:03:24,594 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2024-08-07 14:03:24,594 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2024-08-07 14:03:24,595 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-07 14:03:24,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-07 14:03:24,595 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-07 14:03:24,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2024-08-07 14:03:24,595 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-08-07 14:03:24,595 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-08-07 14:03:24,595 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-07 14:03:24,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-07 14:03:24,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-07 14:03:24,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-07 14:03:24,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2024-08-07 14:03:24,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-07 14:03:24,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-07 14:03:24,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-07 14:03:24,700 INFO L273 CfgBuilder]: Building ICFG [2024-08-07 14:03:24,702 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-07 14:03:52,984 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-08-07 14:03:52,985 INFO L327 CfgBuilder]: Performing block encoding [2024-08-07 14:03:52,998 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-07 14:03:52,998 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-07 14:03:52,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:03:52 BoogieIcfgContainer [2024-08-07 14:03:52,999 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-07 14:03:53,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-07 14:03:53,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-07 14:03:53,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-07 14:03:53,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:03:21" (1/4) ... [2024-08-07 14:03:53,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e3c649 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 02:03:53, skipping insertion in model container [2024-08-07 14:03:53,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.08 02:03:24" (2/4) ... [2024-08-07 14:03:53,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e3c649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 02:03:53, skipping insertion in model container [2024-08-07 14:03:53,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:24" (3/4) ... [2024-08-07 14:03:53,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e3c649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 02:03:53, skipping insertion in model container [2024-08-07 14:03:53,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:03:52" (4/4) ... [2024-08-07 14:03:53,014 INFO L119 eAbstractionObserver]: Analyzing ICFG newton_3_7.i [2024-08-07 14:03:53,014 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-07 14:03:53,037 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-07 14:03:53,037 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-07 14:03:53,114 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,115 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,116 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,117 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,118 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,119 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,120 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,122 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,123 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,123 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,124 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,124 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,128 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,129 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,129 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,129 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,130 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,130 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,131 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,131 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,131 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,132 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,134 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,134 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,135 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,135 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,136 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,136 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,142 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:53,142 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:53,143 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:53,143 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:53,144 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:53,144 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:53,144 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:53,144 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:53,145 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:53,145 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:53,145 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:53,145 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:53,146 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:53,146 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:53,148 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,148 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,149 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,149 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,149 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,149 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,150 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,150 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,150 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,151 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,151 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,151 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,152 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,152 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,152 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,152 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,153 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,153 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,153 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,153 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,154 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,154 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,154 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,154 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,155 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,155 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,165 INFO L90 WitnessUtils]: NestedWordAutomaton nwa = ( callAlphabet = {"call #t~ret4 := f(~x~0);" "call #t~ret3 := fp(~IN~0);" "call #t~ret2 := f(~IN~0);" "call assume_abort_if_not((if ~fp.gt~32(~IN~0, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1.4))) && ~fp.lt~32(~IN~0, ~to_fp~32(currentRoundingMode, 1.4)) then 1bv32 else 0bv32));" "call #t~ret8 := main();" "call ULTIMATE.init();" "call #t~ret7 := fp(~x~0);" "call #t~ret6 := f(~x~0);" "call #t~ret5 := fp(~x~0);" }, internalAlphabet = {"~x := #in~x;#res := ~fp.add~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~x, ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~to_fp~32(currentRoundingMode, 6.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 120.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 5040.0)));" "assume true;" "assume 0bv32 == ~cond;assume false;" "assume !(0bv32 == ~cond);" "~cond := #in~cond;" "assume true;" "~x := #in~x;#res := ~fp.add~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~convertINTToFLOAT(currentRoundingMode, 1bv32), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~to_fp~32(currentRoundingMode, 2.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 24.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 720.0)));" "assume true;" "#res := 0bv32;" "assume false;" "assume !false;" "assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));" "assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));" "~x~0 := ~fp.sub~32(currentRoundingMode, ~x~0, ~fp.div~32(currentRoundingMode, #t~ret6, #t~ret7));havoc #t~ret6;havoc #t~ret7;" "SUMMARY for call #t~ret7 := fp(~x~0); srcloc: L46-1" "SUMMARY for call #t~ret6 := f(~x~0); srcloc: L46-2" "~x~0 := ~fp.sub~32(currentRoundingMode, ~x~0, ~fp.div~32(currentRoundingMode, #t~ret4, #t~ret5));havoc #t~ret4;havoc #t~ret5;" "SUMMARY for call #t~ret5 := fp(~x~0); srcloc: L44-1" "SUMMARY for call #t~ret4 := f(~x~0); srcloc: L44-2" "~x~0 := ~fp.sub~32(currentRoundingMode, ~IN~0, ~fp.div~32(currentRoundingMode, #t~ret2, #t~ret3));havoc #t~ret2;havoc #t~ret3;" "SUMMARY for call #t~ret3 := fp(~IN~0); srcloc: L42-1" "SUMMARY for call #t~ret2 := f(~IN~0); srcloc: L42-2" "SUMMARY for call assume_abort_if_not((if ~fp.gt~32(~IN~0, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1.4))) && ~fp.lt~32(~IN~0, ~to_fp~32(currentRoundingMode, 1.4)) then 1bv32 else 0bv32)); srcloc: L40" "havoc #t~nondet1;~IN~0 := #t~nondet1;havoc #t~nondet1;" "assume true;" "assume 0bv1 == #valid[0bv32];assume ~bvult~32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1#0(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1#0(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);" "assume true;" "SUMMARY for call #t~ret8 := main(); srcloc: L-1" "SUMMARY for call ULTIMATE.init(); srcloc: ULTIMATE.startENTRY" "assume true;" }, returnAlphabet = {"#49#return;" "#51#return;" "#53#return;" "#55#return;" "#57#return;" "#59#return;" "#43#return;" "#45#return;" "#47#return;" }, states = {"CountingPredicate [underlying: 22#fENTRYtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 29#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 22#fENTRYtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 14#fFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 27#fpEXITtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 16#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 6#fpFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 27#fpEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 10#L42-2true, annotation: [3, 0]]" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 27#fpEXITtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 22#fENTRYtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 10#L42-2true, annotation: [1, 0]]" "CountingPredicate [underlying: 25#assume_abort_if_notFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 29#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [17, 0]]" "CountingPredicate [underlying: 30#mainEXITtrue, annotation: [17, 0]]" "CountingPredicate [underlying: 30#mainEXITtrue, annotation: [15, 0]]" "CountingPredicate [underlying: 4#L46true, annotation: [1, 0]]" "CountingPredicate [underlying: 28#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 11#L51true, annotation: [1, 0]]" "CountingPredicate [underlying: 4#L46true, annotation: [15, 0]]" "CountingPredicate [underlying: 24#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 33#L24true, annotation: [1, 0]]" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 21#L44true, annotation: [11, 0]]" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 15#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 21#L44true, annotation: [1, 0]]" "CountingPredicate [underlying: 14#fFINALtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 26#L46-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 19#L42-1true, annotation: [5, 0]]" "CountingPredicate [underlying: 34#L50true, annotation: [15, 0]]" "CountingPredicate [underlying: 9#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 19#L42-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 31#mainFINALtrue, annotation: [15, 0]]" "CountingPredicate [underlying: 22#fENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 31#mainFINALtrue, annotation: [17, 0]]" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 6#fpFINALtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 27#fpEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 13#L44-1true, annotation: [9, 0]]" "CountingPredicate [underlying: 5#L46-2true, annotation: [1, 0]]" "CountingPredicate [underlying: 34#L50true, annotation: [1, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [15, 0]]" "CountingPredicate [underlying: 25#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 31#mainFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 12#L40true, annotation: [0, 0]]" "CountingPredicate [underlying: 28#assume_abort_if_notEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 14#fFINALtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 17#L42true, annotation: [7, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [17, 0]]" "CountingPredicate [underlying: 13#L44-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 14#fFINALtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 26#L46-1true, annotation: [13, 0]]" "CountingPredicate [underlying: 5#L46-2true, annotation: [11, 0]]" "CountingPredicate [underlying: 17#L42true, annotation: [1, 0]]" "CountingPredicate [underlying: 35#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 18#mainENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 30#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 20#L53true, annotation: [1, 0]]" "CountingPredicate [underlying: 32#assume_abort_if_notENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 35#ULTIMATE.startFINALtrue, annotation: [17, 0]]" "CountingPredicate [underlying: 11#L51true, annotation: [16, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 35#ULTIMATE.startFINALtrue, annotation: [15, 0]]" "CountingPredicate [underlying: 6#fpFINALtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 20#L53true, annotation: [17, 0]]" "CountingPredicate [underlying: 23#L44-2true, annotation: [7, 0]]" "CountingPredicate [underlying: 20#L53true, annotation: [15, 0]]" "CountingPredicate [underlying: 6#fpFINALtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 23#L44-2true, annotation: [1, 0]]" }, initialStates = {"CountingPredicate [underlying: 16#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" }, finalStates = {"CountingPredicate [underlying: 29#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [17, 0]]" }, callTransitions = { ("CountingPredicate [underlying: 16#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "call ULTIMATE.init();" "CountingPredicate [underlying: 15#ULTIMATE.initENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 10#L42-2true, annotation: [3, 0]]" "call #t~ret2 := f(~IN~0);" "CountingPredicate [underlying: 22#fENTRYtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 10#L42-2true, annotation: [1, 0]]" "call #t~ret2 := f(~IN~0);" "CountingPredicate [underlying: 22#fENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 26#L46-1true, annotation: [1, 0]]" "call #t~ret7 := fp(~x~0);" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 19#L42-1true, annotation: [5, 0]]" "call #t~ret3 := fp(~IN~0);" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 19#L42-1true, annotation: [1, 0]]" "call #t~ret3 := fp(~IN~0);" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 13#L44-1true, annotation: [9, 0]]" "call #t~ret5 := fp(~x~0);" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 5#L46-2true, annotation: [1, 0]]" "call #t~ret6 := f(~x~0);" "CountingPredicate [underlying: 22#fENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 12#L40true, annotation: [0, 0]]" "call assume_abort_if_not((if ~fp.gt~32(~IN~0, ~fp.neg~32(~to_fp~32(currentRoundingMode, 1.4))) && ~fp.lt~32(~IN~0, ~to_fp~32(currentRoundingMode, 1.4)) then 1bv32 else 0bv32));" "CountingPredicate [underlying: 32#assume_abort_if_notENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 13#L44-1true, annotation: [1, 0]]" "call #t~ret5 := fp(~x~0);" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 26#L46-1true, annotation: [13, 0]]" "call #t~ret7 := fp(~x~0);" "CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [14, 0]]") ("CountingPredicate [underlying: 5#L46-2true, annotation: [11, 0]]" "call #t~ret6 := f(~x~0);" "CountingPredicate [underlying: 22#fENTRYtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 23#L44-2true, annotation: [7, 0]]" "call #t~ret4 := f(~x~0);" "CountingPredicate [underlying: 22#fENTRYtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "call #t~ret8 := main();" "CountingPredicate [underlying: 18#mainENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 23#L44-2true, annotation: [1, 0]]" "call #t~ret4 := f(~x~0);" "CountingPredicate [underlying: 22#fENTRYtrue, annotation: [1, 0]]") }, internalTransitions = { ("CountingPredicate [underlying: 22#fENTRYtrue, annotation: [8, 0]]" "~x := #in~x;#res := ~fp.add~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~x, ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~to_fp~32(currentRoundingMode, 6.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 120.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 5040.0)));" "CountingPredicate [underlying: 14#fFINALtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 22#fENTRYtrue, annotation: [4, 0]]" "~x := #in~x;#res := ~fp.add~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~x, ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~to_fp~32(currentRoundingMode, 6.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 120.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 5040.0)));" "CountingPredicate [underlying: 14#fFINALtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 14#fFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [6, 0]]" "~x := #in~x;#res := ~fp.add~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~convertINTToFLOAT(currentRoundingMode, 1bv32), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~to_fp~32(currentRoundingMode, 2.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 24.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 720.0)));" "CountingPredicate [underlying: 6#fpFINALtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 6#fpFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 27#fpEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [10, 0]]" "~x := #in~x;#res := ~fp.add~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~convertINTToFLOAT(currentRoundingMode, 1bv32), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~to_fp~32(currentRoundingMode, 2.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 24.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 720.0)));" "CountingPredicate [underlying: 6#fpFINALtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 22#fENTRYtrue, annotation: [12, 0]]" "~x := #in~x;#res := ~fp.add~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~x, ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~to_fp~32(currentRoundingMode, 6.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 120.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 5040.0)));" "CountingPredicate [underlying: 14#fFINALtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 25#assume_abort_if_notFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 28#assume_abort_if_notEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [14, 0]]" "~x := #in~x;#res := ~fp.add~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~convertINTToFLOAT(currentRoundingMode, 1bv32), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~to_fp~32(currentRoundingMode, 2.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 24.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 720.0)));" "CountingPredicate [underlying: 6#fpFINALtrue, annotation: [14, 0]]") ("CountingPredicate [underlying: 4#L46true, annotation: [1, 0]]" "~x~0 := ~fp.sub~32(currentRoundingMode, ~x~0, ~fp.div~32(currentRoundingMode, #t~ret6, #t~ret7));havoc #t~ret6;havoc #t~ret7;" "CountingPredicate [underlying: 34#L50true, annotation: [1, 0]]") ("CountingPredicate [underlying: 11#L51true, annotation: [1, 0]]" "assume false;" "CountingPredicate [underlying: 20#L53true, annotation: [1, 0]]") ("CountingPredicate [underlying: 11#L51true, annotation: [1, 0]]" "assume !false;" "CountingPredicate [underlying: 29#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 4#L46true, annotation: [15, 0]]" "~x~0 := ~fp.sub~32(currentRoundingMode, ~x~0, ~fp.div~32(currentRoundingMode, #t~ret6, #t~ret7));havoc #t~ret6;havoc #t~ret7;" "CountingPredicate [underlying: 34#L50true, annotation: [15, 0]]") ("CountingPredicate [underlying: 24#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 9#ULTIMATE.initEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 33#L24true, annotation: [1, 0]]" "assume 0bv32 == ~cond;assume false;" "CountingPredicate [underlying: 25#assume_abort_if_notFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 33#L24true, annotation: [1, 0]]" "assume !(0bv32 == ~cond);" "CountingPredicate [underlying: 25#assume_abort_if_notFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 21#L44true, annotation: [11, 0]]" "~x~0 := ~fp.sub~32(currentRoundingMode, ~x~0, ~fp.div~32(currentRoundingMode, #t~ret4, #t~ret5));havoc #t~ret4;havoc #t~ret5;" "CountingPredicate [underlying: 5#L46-2true, annotation: [11, 0]]") ("CountingPredicate [underlying: 15#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "assume 0bv1 == #valid[0bv32];assume ~bvult~32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1#0(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1#0(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);" "CountingPredicate [underlying: 24#ULTIMATE.initFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 21#L44true, annotation: [1, 0]]" "~x~0 := ~fp.sub~32(currentRoundingMode, ~x~0, ~fp.div~32(currentRoundingMode, #t~ret4, #t~ret5));havoc #t~ret4;havoc #t~ret5;" "CountingPredicate [underlying: 5#L46-2true, annotation: [1, 0]]") ("CountingPredicate [underlying: 14#fFINALtrue, annotation: [4, 0]]" "assume true;" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [4, 0]]") ("CountingPredicate [underlying: 34#L50true, annotation: [15, 0]]" "assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));" "CountingPredicate [underlying: 11#L51true, annotation: [16, 0]]") ("CountingPredicate [underlying: 34#L50true, annotation: [15, 0]]" "assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));" "CountingPredicate [underlying: 20#L53true, annotation: [15, 0]]") ("CountingPredicate [underlying: 8#fpENTRYtrue, annotation: [1, 0]]" "~x := #in~x;#res := ~fp.add~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~convertINTToFLOAT(currentRoundingMode, 1bv32), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~to_fp~32(currentRoundingMode, 2.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 24.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 720.0)));" "CountingPredicate [underlying: 6#fpFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 31#mainFINALtrue, annotation: [15, 0]]" "assume true;" "CountingPredicate [underlying: 30#mainEXITtrue, annotation: [15, 0]]") ("CountingPredicate [underlying: 22#fENTRYtrue, annotation: [1, 0]]" "~x := #in~x;#res := ~fp.add~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~x, ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~to_fp~32(currentRoundingMode, 6.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 120.0))), ~fp.div~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~x, ~x), ~x), ~x), ~x), ~x), ~x), ~to_fp~32(currentRoundingMode, 5040.0)));" "CountingPredicate [underlying: 14#fFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 31#mainFINALtrue, annotation: [17, 0]]" "assume true;" "CountingPredicate [underlying: 30#mainEXITtrue, annotation: [17, 0]]") ("CountingPredicate [underlying: 6#fpFINALtrue, annotation: [6, 0]]" "assume true;" "CountingPredicate [underlying: 27#fpEXITtrue, annotation: [6, 0]]") ("CountingPredicate [underlying: 34#L50true, annotation: [1, 0]]" "assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));" "CountingPredicate [underlying: 11#L51true, annotation: [1, 0]]") ("CountingPredicate [underlying: 34#L50true, annotation: [1, 0]]" "assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));" "CountingPredicate [underlying: 20#L53true, annotation: [1, 0]]") ("CountingPredicate [underlying: 25#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 28#assume_abort_if_notEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 31#mainFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 30#mainEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 14#fFINALtrue, annotation: [12, 0]]" "assume true;" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [12, 0]]") ("CountingPredicate [underlying: 17#L42true, annotation: [7, 0]]" "~x~0 := ~fp.sub~32(currentRoundingMode, ~IN~0, ~fp.div~32(currentRoundingMode, #t~ret2, #t~ret3));havoc #t~ret2;havoc #t~ret3;" "CountingPredicate [underlying: 23#L44-2true, annotation: [7, 0]]") ("CountingPredicate [underlying: 14#fFINALtrue, annotation: [8, 0]]" "assume true;" "CountingPredicate [underlying: 3#fEXITtrue, annotation: [8, 0]]") ("CountingPredicate [underlying: 17#L42true, annotation: [1, 0]]" "~x~0 := ~fp.sub~32(currentRoundingMode, ~IN~0, ~fp.div~32(currentRoundingMode, #t~ret2, #t~ret3));havoc #t~ret2;havoc #t~ret3;" "CountingPredicate [underlying: 23#L44-2true, annotation: [1, 0]]") ("CountingPredicate [underlying: 35#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 18#mainENTRYtrue, annotation: [0, 0]]" "havoc #t~nondet1;~IN~0 := #t~nondet1;havoc #t~nondet1;" "CountingPredicate [underlying: 12#L40true, annotation: [0, 0]]") ("CountingPredicate [underlying: 20#L53true, annotation: [1, 0]]" "#res := 0bv32;" "CountingPredicate [underlying: 31#mainFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 32#assume_abort_if_notENTRYtrue, annotation: [1, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 33#L24true, annotation: [1, 0]]") ("CountingPredicate [underlying: 35#ULTIMATE.startFINALtrue, annotation: [17, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [17, 0]]") ("CountingPredicate [underlying: 11#L51true, annotation: [16, 0]]" "assume false;" "CountingPredicate [underlying: 20#L53true, annotation: [17, 0]]") ("CountingPredicate [underlying: 11#L51true, annotation: [16, 0]]" "assume !false;" "CountingPredicate [underlying: 29#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [17, 0]]") ("CountingPredicate [underlying: 35#ULTIMATE.startFINALtrue, annotation: [15, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [15, 0]]") ("CountingPredicate [underlying: 6#fpFINALtrue, annotation: [10, 0]]" "assume true;" "CountingPredicate [underlying: 27#fpEXITtrue, annotation: [10, 0]]") ("CountingPredicate [underlying: 20#L53true, annotation: [17, 0]]" "#res := 0bv32;" "CountingPredicate [underlying: 31#mainFINALtrue, annotation: [17, 0]]") ("CountingPredicate [underlying: 20#L53true, annotation: [15, 0]]" "#res := 0bv32;" "CountingPredicate [underlying: 31#mainFINALtrue, annotation: [15, 0]]") ("CountingPredicate [underlying: 6#fpFINALtrue, annotation: [14, 0]]" "assume true;" "CountingPredicate [underlying: 27#fpEXITtrue, annotation: [14, 0]]") }, returnTransitions = { ("CountingPredicate [underlying: 27#fpEXITtrue, annotation: [14, 0]]" "CountingPredicate [underlying: 26#L46-1true, annotation: [13, 0]]" "#43#return;" "CountingPredicate [underlying: 4#L46true, annotation: [15, 0]]") ("CountingPredicate [underlying: 27#fpEXITtrue, annotation: [10, 0]]" "CountingPredicate [underlying: 13#L44-1true, annotation: [9, 0]]" "#47#return;" "CountingPredicate [underlying: 21#L44true, annotation: [11, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [4, 0]]" "CountingPredicate [underlying: 10#L42-2true, annotation: [3, 0]]" "#53#return;" "CountingPredicate [underlying: 19#L42-1true, annotation: [5, 0]]") ("CountingPredicate [underlying: 27#fpEXITtrue, annotation: [6, 0]]" "CountingPredicate [underlying: 19#L42-1true, annotation: [5, 0]]" "#51#return;" "CountingPredicate [underlying: 17#L42true, annotation: [7, 0]]") ("CountingPredicate [underlying: 30#mainEXITtrue, annotation: [17, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "#57#return;" "CountingPredicate [underlying: 35#ULTIMATE.startFINALtrue, annotation: [17, 0]]") ("CountingPredicate [underlying: 30#mainEXITtrue, annotation: [15, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "#57#return;" "CountingPredicate [underlying: 35#ULTIMATE.startFINALtrue, annotation: [15, 0]]") ("CountingPredicate [underlying: 28#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 12#L40true, annotation: [0, 0]]" "#55#return;" "CountingPredicate [underlying: 10#L42-2true, annotation: [3, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [8, 0]]" "CountingPredicate [underlying: 23#L44-2true, annotation: [7, 0]]" "#49#return;" "CountingPredicate [underlying: 13#L44-1true, annotation: [9, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [12, 0]]" "CountingPredicate [underlying: 5#L46-2true, annotation: [11, 0]]" "#45#return;" "CountingPredicate [underlying: 26#L46-1true, annotation: [13, 0]]") ("CountingPredicate [underlying: 9#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 16#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "#59#return;" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 5#L46-2true, annotation: [1, 0]]" "#45#return;" "CountingPredicate [underlying: 26#L46-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 23#L44-2true, annotation: [1, 0]]" "#49#return;" "CountingPredicate [underlying: 13#L44-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 3#fEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 10#L42-2true, annotation: [1, 0]]" "#53#return;" "CountingPredicate [underlying: 19#L42-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 27#fpEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 26#L46-1true, annotation: [1, 0]]" "#43#return;" "CountingPredicate [underlying: 4#L46true, annotation: [1, 0]]") ("CountingPredicate [underlying: 27#fpEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 19#L42-1true, annotation: [1, 0]]" "#51#return;" "CountingPredicate [underlying: 17#L42true, annotation: [1, 0]]") ("CountingPredicate [underlying: 27#fpEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 13#L44-1true, annotation: [1, 0]]" "#47#return;" "CountingPredicate [underlying: 21#L44true, annotation: [1, 0]]") ("CountingPredicate [underlying: 28#assume_abort_if_notEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 12#L40true, annotation: [0, 0]]" "#55#return;" "CountingPredicate [underlying: 10#L42-2true, annotation: [1, 0]]") ("CountingPredicate [underlying: 30#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 7#L-1true, annotation: [0, 0]]" "#57#return;" "CountingPredicate [underlying: 35#ULTIMATE.startFINALtrue, annotation: [1, 0]]") } ); [2024-08-07 14:03:53,171 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 34 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-08-07 14:03:53,175 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,176 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,176 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,177 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,177 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,178 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,178 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,178 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,178 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,179 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,179 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,179 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,179 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,179 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,180 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,180 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,182 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,182 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,183 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,183 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,183 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,183 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,184 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,184 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,184 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,185 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,186 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,187 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,189 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:53,190 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:53,191 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:53,191 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:53,191 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:53,192 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:53,193 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:53,193 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:53,194 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:53,195 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:53,195 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:53,195 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:53,196 WARN L283 nessProductAutomaton]: assume !~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated false [2024-08-07 14:03:53,196 WARN L283 nessProductAutomaton]: assume !!~fp.lt~64(~convertFLOATToDOUBLE(currentRoundingMode, ~x~0), ~to_fp~64(currentRoundingMode, 0.1));, isNegated true [2024-08-07 14:03:53,196 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,196 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,197 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,197 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,197 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,198 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,198 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,198 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,199 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,199 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,199 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,199 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,200 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,200 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,200 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,200 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,201 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,201 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,201 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,202 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,202 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,202 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,202 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,202 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,203 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:53,203 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:53,209 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 76 states to 41 states. [2024-08-07 14:03:53,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-07 14:03:53,236 INFO L357 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, mHoare=false, 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;@51779482, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-07 14:03:53,237 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-07 14:03:53,238 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2024-08-07 14:03:53,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-08-07 14:03:53,244 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 14:03:53,244 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-07 14:03:53,245 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 14:03:53,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 14:03:53,252 INFO L85 PathProgramCache]: Analyzing trace with hash -900940148, now seen corresponding path program 1 times [2024-08-07 14:03:53,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-07 14:03:53,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572973449] [2024-08-07 14:03:53,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 14:03:53,264 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 [2024-08-07 14:03:53,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-07 14:03:53,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-08-07 14:03:53,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-08-07 14:04:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 14:04:02,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.