./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/floats-cdfpl/square_1.i --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/square_1.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/square_1.i ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/square_1.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:30,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-07 14:03:30,158 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:30,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-07 14:03:30,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-07 14:03:30,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-07 14:03:30,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-07 14:03:30,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-07 14:03:30,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-07 14:03:30,206 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-07 14:03:30,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-07 14:03:30,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-07 14:03:30,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-07 14:03:30,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-07 14:03:30,209 INFO L153 SettingsManager]: * Use SBE=true [2024-08-07 14:03:30,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-07 14:03:30,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-07 14:03:30,210 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-07 14:03:30,211 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-07 14:03:30,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-07 14:03:30,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-07 14:03:30,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-07 14:03:30,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-07 14:03:30,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-07 14:03:30,216 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-07 14:03:30,216 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-07 14:03:30,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-07 14:03:30,216 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-07 14:03:30,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-07 14:03:30,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-07 14:03:30,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-07 14:03:30,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-07 14:03:30,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-07 14:03:30,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-07 14:03:30,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-07 14:03:30,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-07 14:03:30,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-07 14:03:30,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-07 14:03:30,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-07 14:03:30,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-07 14:03:30,219 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-07 14:03:30,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-07 14:03:30,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-07 14:03:30,221 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:30,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-07 14:03:30,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-07 14:03:30,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-07 14:03:30,576 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-07 14:03:30,577 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-07 14:03:30,579 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/square_1.yml/witness.yml [2024-08-07 14:03:30,643 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-07 14:03:30,643 INFO L274 PluginConnector]: CDTParser initialized [2024-08-07 14:03:30,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-cdfpl/square_1.i [2024-08-07 14:03:32,247 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-07 14:03:32,433 INFO L384 CDTParser]: Found 1 translation units. [2024-08-07 14:03:32,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-cdfpl/square_1.i [2024-08-07 14:03:32,441 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/689619bc2/6795d2c47a2140c58fb50a9d00632522/FLAG24ccecbb8 [2024-08-07 14:03:32,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/689619bc2/6795d2c47a2140c58fb50a9d00632522 [2024-08-07 14:03:32,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-07 14:03:32,460 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-07 14:03:32,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-07 14:03:32,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-07 14:03:32,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-07 14:03:32,467 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:30" (1/2) ... [2024-08-07 14:03:32,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de51d8b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:32, skipping insertion in model container [2024-08-07 14:03:32,468 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:30" (1/2) ... [2024-08-07 14:03:32,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@25eba075 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:32, skipping insertion in model container [2024-08-07 14:03:32,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:03:32" (2/2) ... [2024-08-07 14:03:32,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de51d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:32, skipping insertion in model container [2024-08-07 14:03:32,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:03:32" (2/2) ... [2024-08-07 14:03:32,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-07 14:03:32,661 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/square_1.i[1626,1639] [2024-08-07 14:03:32,666 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:03:32,682 INFO L200 MainTranslator]: Completed pre-run [2024-08-07 14:03:32,697 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/square_1.i[1626,1639] [2024-08-07 14:03:32,699 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:03:32,714 INFO L204 MainTranslator]: Completed translation [2024-08-07 14:03:32,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:32 WrapperNode [2024-08-07 14:03:32,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-07 14:03:32,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-07 14:03:32,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-07 14:03:32,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-07 14:03:32,727 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:32" (1/1) ... [2024-08-07 14:03:32,728 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:32" (1/1) ... [2024-08-07 14:03:32,734 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:32" (1/1) ... [2024-08-07 14:03:32,750 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:32,751 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:32" (1/1) ... [2024-08-07 14:03:32,751 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:32" (1/1) ... [2024-08-07 14:03:32,756 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:32" (1/1) ... [2024-08-07 14:03:32,757 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:32" (1/1) ... [2024-08-07 14:03:32,758 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:32" (1/1) ... [2024-08-07 14:03:32,760 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-07 14:03:32,761 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-07 14:03:32,761 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-07 14:03:32,762 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-07 14:03:32,762 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:32" (1/1) ... [2024-08-07 14:03:32,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-07 14:03:32,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-07 14:03:32,796 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:32,804 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:32,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-07 14:03:32,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-07 14:03:32,847 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-07 14:03:32,847 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-07 14:03:32,848 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-07 14:03:32,848 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-07 14:03:32,848 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-07 14:03:32,848 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2024-08-07 14:03:32,848 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2024-08-07 14:03:32,848 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-07 14:03:32,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-07 14:03:32,850 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-07 14:03:32,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2024-08-07 14:03:32,850 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-07 14:03:32,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-07 14:03:32,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-07 14:03:32,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-07 14:03:32,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-07 14:03:32,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-07 14:03:32,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-07 14:03:32,936 INFO L273 CfgBuilder]: Building ICFG [2024-08-07 14:03:32,940 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-07 14:03:33,070 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-08-07 14:03:33,070 INFO L327 CfgBuilder]: Performing block encoding [2024-08-07 14:03:33,081 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-07 14:03:33,081 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-07 14:03:33,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:03:33 BoogieIcfgContainer [2024-08-07 14:03:33,082 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-07 14:03:33,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-07 14:03:33,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-07 14:03:33,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-07 14:03:33,090 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:30" (1/4) ... [2024-08-07 14:03:33,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0fd7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 02:03:33, skipping insertion in model container [2024-08-07 14:03:33,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.08 02:03:32" (2/4) ... [2024-08-07 14:03:33,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 02:03:33, skipping insertion in model container [2024-08-07 14:03:33,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:32" (3/4) ... [2024-08-07 14:03:33,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 02:03:33, skipping insertion in model container [2024-08-07 14:03:33,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:03:33" (4/4) ... [2024-08-07 14:03:33,094 INFO L119 eAbstractionObserver]: Analyzing ICFG square_1.i [2024-08-07 14:03:33,095 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:33,118 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-07 14:03:33,118 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-07 14:03:33,177 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,178 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,179 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,179 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,180 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,181 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,182 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,183 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,184 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,186 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,187 WARN L283 nessProductAutomaton]: assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated false [2024-08-07 14:03:33,187 WARN L283 nessProductAutomaton]: assume !!(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated true [2024-08-07 14:03:33,187 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,188 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,188 WARN L283 nessProductAutomaton]: assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated false [2024-08-07 14:03:33,188 WARN L283 nessProductAutomaton]: assume !!(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated true [2024-08-07 14:03:33,189 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,189 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,189 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,190 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,191 WARN L283 nessProductAutomaton]: assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated false [2024-08-07 14:03:33,192 WARN L283 nessProductAutomaton]: assume !!(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated true [2024-08-07 14:03:33,192 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,192 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,195 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,196 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,198 WARN L283 nessProductAutomaton]: assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated false [2024-08-07 14:03:33,198 WARN L283 nessProductAutomaton]: assume !!(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated true [2024-08-07 14:03:33,199 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,199 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,199 WARN L283 nessProductAutomaton]: assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated false [2024-08-07 14:03:33,203 WARN L283 nessProductAutomaton]: assume !!(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated true [2024-08-07 14:03:33,203 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,203 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,204 WARN L283 nessProductAutomaton]: assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated false [2024-08-07 14:03:33,204 WARN L283 nessProductAutomaton]: assume !!(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated true [2024-08-07 14:03:33,206 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,206 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,206 WARN L283 nessProductAutomaton]: assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated false [2024-08-07 14:03:33,207 WARN L283 nessProductAutomaton]: assume !!(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated true [2024-08-07 14:03:33,213 INFO L90 WitnessUtils]: NestedWordAutomaton nwa = ( callAlphabet = {"call assume_abort_if_not((if ~someBinaryFLOATComparisonOperation(~IN~0, 0.0) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.0) then 1 else 0));" "call #t~ret2 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume 0 == ~cond;assume false;" "assume !(0 == ~cond);" "~cond := #in~cond;" "assume true;" "#res := 0;" "assume false;" "assume !false;" "assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));" "assume !!(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));" "~x~0 := ~IN~0;~result~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(1.0, ~someBinaryArithmeticFLOAToperation(0.5, ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.125, ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0625, ~x~0), ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0390625, ~x~0), ~x~0), ~x~0), ~x~0));" "SUMMARY for call assume_abort_if_not((if ~someBinaryFLOATComparisonOperation(~IN~0, 0.0) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.0) then 1 else 0)); srcloc: L30-1" "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(11, 2);" "assume true;" "SUMMARY for call #t~ret2 := main(); srcloc: L-1" "SUMMARY for call ULTIMATE.init(); srcloc: ULTIMATE.startENTRY" "assume true;" }, returnAlphabet = {"#22#return;" "#24#return;" "#26#return;" }, states = {"CountingPredicate [underlying: 9#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 14#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 8#L37true, annotation: [1, 0]]" "CountingPredicate [underlying: 19#L24true, annotation: [1, 0]]" "CountingPredicate [underlying: 14#assume_abort_if_notEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 8#L37true, annotation: [3, 0]]" "CountingPredicate [underlying: 3#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 10#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 10#assume_abort_if_notFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 5#mainENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 4#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 12#L38true, annotation: [1, 0]]" "CountingPredicate [underlying: 16#mainFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 11#L30-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 13#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 17#L40true, annotation: [5, 0]]" "CountingPredicate [underlying: 16#mainFINALtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 12#L38true, annotation: [4, 0]]" "CountingPredicate [underlying: 17#L40true, annotation: [3, 0]]" "CountingPredicate [underlying: 16#mainFINALtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 17#L40true, annotation: [1, 0]]" "CountingPredicate [underlying: 13#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 18#assume_abort_if_notENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 20#L30true, annotation: [3, 0]]" "CountingPredicate [underlying: 20#L30true, annotation: [1, 0]]" "CountingPredicate [underlying: 15#mainEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 15#mainEXITtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 15#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 7#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 21#ULTIMATE.startFINALtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 21#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 21#ULTIMATE.startFINALtrue, annotation: [5, 0]]" }, initialStates = {"CountingPredicate [underlying: 4#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" }, finalStates = {"CountingPredicate [underlying: 13#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [5, 0]]" }, callTransitions = { ("CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "call #t~ret2 := main();" "CountingPredicate [underlying: 5#mainENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 4#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "call ULTIMATE.init();" "CountingPredicate [underlying: 3#ULTIMATE.initENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 11#L30-1true, annotation: [0, 0]]" "call assume_abort_if_not((if ~someBinaryFLOATComparisonOperation(~IN~0, 0.0) && ~someBinaryFLOATComparisonOperation(~IN~0, 1.0) then 1 else 0));" "CountingPredicate [underlying: 18#assume_abort_if_notENTRYtrue, annotation: [1, 0]]") }, internalTransitions = { ("CountingPredicate [underlying: 8#L37true, annotation: [1, 0]]" "assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));" "CountingPredicate [underlying: 12#L38true, annotation: [1, 0]]") ("CountingPredicate [underlying: 8#L37true, annotation: [1, 0]]" "assume !!(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));" "CountingPredicate [underlying: 17#L40true, annotation: [1, 0]]") ("CountingPredicate [underlying: 19#L24true, annotation: [1, 0]]" "assume 0 == ~cond;assume false;" "CountingPredicate [underlying: 10#assume_abort_if_notFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 19#L24true, annotation: [1, 0]]" "assume !(0 == ~cond);" "CountingPredicate [underlying: 10#assume_abort_if_notFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 8#L37true, annotation: [3, 0]]" "assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));" "CountingPredicate [underlying: 12#L38true, annotation: [4, 0]]") ("CountingPredicate [underlying: 8#L37true, annotation: [3, 0]]" "assume !!(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));" "CountingPredicate [underlying: 17#L40true, annotation: [3, 0]]") ("CountingPredicate [underlying: 3#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(11, 2);" "CountingPredicate [underlying: 7#ULTIMATE.initFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 10#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 14#assume_abort_if_notEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 10#assume_abort_if_notFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 14#assume_abort_if_notEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 5#mainENTRYtrue, annotation: [0, 0]]" "havoc #t~nondet1;~IN~0 := #t~nondet1;havoc #t~nondet1;" "CountingPredicate [underlying: 11#L30-1true, annotation: [0, 0]]") ("CountingPredicate [underlying: 12#L38true, annotation: [1, 0]]" "assume false;" "CountingPredicate [underlying: 17#L40true, annotation: [1, 0]]") ("CountingPredicate [underlying: 12#L38true, annotation: [1, 0]]" "assume !false;" "CountingPredicate [underlying: 13#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 16#mainFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 15#mainEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 17#L40true, annotation: [5, 0]]" "#res := 0;" "CountingPredicate [underlying: 16#mainFINALtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 16#mainFINALtrue, annotation: [3, 0]]" "assume true;" "CountingPredicate [underlying: 15#mainEXITtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 12#L38true, annotation: [4, 0]]" "assume false;" "CountingPredicate [underlying: 17#L40true, annotation: [5, 0]]") ("CountingPredicate [underlying: 12#L38true, annotation: [4, 0]]" "assume !false;" "CountingPredicate [underlying: 13#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 17#L40true, annotation: [3, 0]]" "#res := 0;" "CountingPredicate [underlying: 16#mainFINALtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 16#mainFINALtrue, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 15#mainEXITtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 17#L40true, annotation: [1, 0]]" "#res := 0;" "CountingPredicate [underlying: 16#mainFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 18#assume_abort_if_notENTRYtrue, annotation: [1, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 19#L24true, annotation: [1, 0]]") ("CountingPredicate [underlying: 20#L30true, annotation: [3, 0]]" "~x~0 := ~IN~0;~result~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(1.0, ~someBinaryArithmeticFLOAToperation(0.5, ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.125, ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0625, ~x~0), ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0390625, ~x~0), ~x~0), ~x~0), ~x~0));" "CountingPredicate [underlying: 8#L37true, annotation: [3, 0]]") ("CountingPredicate [underlying: 20#L30true, annotation: [1, 0]]" "~x~0 := ~IN~0;~result~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(1.0, ~someBinaryArithmeticFLOAToperation(0.5, ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.125, ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0625, ~x~0), ~x~0), ~x~0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.0390625, ~x~0), ~x~0), ~x~0), ~x~0));" "CountingPredicate [underlying: 8#L37true, annotation: [1, 0]]") ("CountingPredicate [underlying: 7#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 9#ULTIMATE.initEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 21#ULTIMATE.startFINALtrue, annotation: [3, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 21#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 21#ULTIMATE.startFINALtrue, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [5, 0]]") }, returnTransitions = { ("CountingPredicate [underlying: 9#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 4#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "#26#return;" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]") ("CountingPredicate [underlying: 14#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 11#L30-1true, annotation: [0, 0]]" "#22#return;" "CountingPredicate [underlying: 20#L30true, annotation: [3, 0]]") ("CountingPredicate [underlying: 14#assume_abort_if_notEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 11#L30-1true, annotation: [0, 0]]" "#22#return;" "CountingPredicate [underlying: 20#L30true, annotation: [1, 0]]") ("CountingPredicate [underlying: 15#mainEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "#24#return;" "CountingPredicate [underlying: 21#ULTIMATE.startFINALtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 15#mainEXITtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "#24#return;" "CountingPredicate [underlying: 21#ULTIMATE.startFINALtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 15#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "#24#return;" "CountingPredicate [underlying: 21#ULTIMATE.startFINALtrue, annotation: [1, 0]]") } ); [2024-08-07 14:03:33,218 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-07 14:03:33,219 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,219 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,220 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,220 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,220 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,220 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,221 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,221 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,226 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,226 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,226 WARN L283 nessProductAutomaton]: assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated false [2024-08-07 14:03:33,226 WARN L283 nessProductAutomaton]: assume !!(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated true [2024-08-07 14:03:33,227 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,227 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,231 WARN L283 nessProductAutomaton]: assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated false [2024-08-07 14:03:33,231 WARN L283 nessProductAutomaton]: assume !!(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated true [2024-08-07 14:03:33,232 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,232 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,232 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,232 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,233 WARN L283 nessProductAutomaton]: assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated false [2024-08-07 14:03:33,233 WARN L283 nessProductAutomaton]: assume !!(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated true [2024-08-07 14:03:33,233 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,234 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,235 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,235 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,235 WARN L283 nessProductAutomaton]: assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated false [2024-08-07 14:03:33,236 WARN L283 nessProductAutomaton]: assume !!(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated true [2024-08-07 14:03:33,236 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,237 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,237 WARN L283 nessProductAutomaton]: assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated false [2024-08-07 14:03:33,237 WARN L283 nessProductAutomaton]: assume !!(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated true [2024-08-07 14:03:33,238 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,239 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,239 WARN L283 nessProductAutomaton]: assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated false [2024-08-07 14:03:33,239 WARN L283 nessProductAutomaton]: assume !!(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated true [2024-08-07 14:03:33,240 WARN L283 nessProductAutomaton]: assume 0 == ~cond;assume false;, isNegated false [2024-08-07 14:03:33,240 WARN L283 nessProductAutomaton]: assume !(0 == ~cond);, isNegated true [2024-08-07 14:03:33,241 WARN L283 nessProductAutomaton]: assume !(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated false [2024-08-07 14:03:33,241 WARN L283 nessProductAutomaton]: assume !!(~someBinaryFLOATComparisonOperation(~result~0, 0.0) && ~someBinaryFLOATComparisonOperation(~result~0, 1.39));, isNegated true [2024-08-07 14:03:33,248 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 36 states to 15 states. [2024-08-07 14:03:33,273 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-07 14:03:33,279 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;@1bd21614, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-07 14:03:33,281 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-07 14:03:33,282 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2024-08-07 14:03:33,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-08-07 14:03:33,286 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 14:03:33,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-07 14:03:33,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 14:03:33,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 14:03:33,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1774463457, now seen corresponding path program 1 times [2024-08-07 14:03:33,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-07 14:03:33,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208918658] [2024-08-07 14:03:33,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 14:03:33,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-07 14:03:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 14:03:33,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-07 14:03:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 14:03:33,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-07 14:03:33,433 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-07 14:03:33,434 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-07 14:03:33,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-07 14:03:33,441 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-07 14:03:33,446 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-07 14:03:33,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.08 02:03:33 BoogieIcfgContainer [2024-08-07 14:03:33,460 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-07 14:03:33,461 INFO L158 Benchmark]: Toolchain (without parser) took 1000.71ms. Allocated memory was 62.9MB in the beginning and 90.2MB in the end (delta: 27.3MB). Free memory was 42.6MB in the beginning and 42.8MB in the end (delta: -218.1kB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2024-08-07 14:03:33,461 INFO L158 Benchmark]: Witness Parser took 0.24ms. Allocated memory is still 62.9MB. Free memory is still 38.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:03:33,462 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 62.9MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:03:33,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.53ms. Allocated memory is still 62.9MB. Free memory was 42.4MB in the beginning and 31.0MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-08-07 14:03:33,463 INFO L158 Benchmark]: Boogie Preprocessor took 44.90ms. Allocated memory is still 62.9MB. Free memory was 31.0MB in the beginning and 29.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:03:33,463 INFO L158 Benchmark]: IcfgBuilder took 321.18ms. Allocated memory was 62.9MB in the beginning and 90.2MB in the end (delta: 27.3MB). Free memory was 28.9MB in the beginning and 64.9MB in the end (delta: -36.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-08-07 14:03:33,464 INFO L158 Benchmark]: TraceAbstraction took 374.58ms. Allocated memory is still 90.2MB. Free memory was 64.2MB in the beginning and 42.8MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-08-07 14:03:33,466 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.24ms. Allocated memory is still 62.9MB. Free memory is still 38.8MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.12ms. Allocated memory is still 62.9MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.53ms. Allocated memory is still 62.9MB. Free memory was 42.4MB in the beginning and 31.0MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.90ms. Allocated memory is still 62.9MB. Free memory was 31.0MB in the beginning and 29.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 321.18ms. Allocated memory was 62.9MB in the beginning and 90.2MB in the end (delta: 27.3MB). Free memory was 28.9MB in the beginning and 64.9MB in the end (delta: -36.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 374.58ms. Allocated memory is still 90.2MB. Free memory was 64.2MB in the beginning and 42.8MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. 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: 38]: 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 37, overapproximation of someBinaryArithmeticFLOAToperation at line 35. Possible FailurePath: [L29] float IN = __VERIFIER_nondet_float(); [L30] CALL assume_abort_if_not(IN >= 0.0f && IN < 1.0f) VAL [\old(cond)=1] [L24] !cond VAL [\old(cond)=1] [L30] RET assume_abort_if_not(IN >= 0.0f && IN < 1.0f) [L32] float x = IN; [L34-L35] float result = 1.0f + 0.5f*x - 0.125f*x*x + 0.0625f*x*x*x - 0.0390625f*x*x*x*x; [L37] !(result >= 0.0f && result < 1.39f) [L38] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred 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, 14 NumberOfCodeBlocks, 14 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:33,497 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/square_1.i ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/square_1.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:35,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-07 14:03:35,684 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:35,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-07 14:03:35,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-07 14:03:35,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-07 14:03:35,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-07 14:03:35,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-07 14:03:35,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-07 14:03:35,723 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-07 14:03:35,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-07 14:03:35,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-07 14:03:35,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-07 14:03:35,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-07 14:03:35,725 INFO L153 SettingsManager]: * Use SBE=true [2024-08-07 14:03:35,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-07 14:03:35,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-07 14:03:35,726 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-07 14:03:35,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-07 14:03:35,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-07 14:03:35,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-07 14:03:35,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-07 14:03:35,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-07 14:03:35,734 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-08-07 14:03:35,734 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-08-07 14:03:35,735 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-07 14:03:35,735 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-08-07 14:03:35,735 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-07 14:03:35,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-07 14:03:35,736 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-07 14:03:35,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-07 14:03:35,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-07 14:03:35,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-07 14:03:35,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-07 14:03:35,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-07 14:03:35,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-07 14:03:35,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-07 14:03:35,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-07 14:03:35,738 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-08-07 14:03:35,738 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-08-07 14:03:35,739 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-07 14:03:35,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-07 14:03:35,741 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-07 14:03:35,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-07 14:03:35,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-07 14:03:35,741 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-08-07 14:03:35,742 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:36,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-07 14:03:36,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-07 14:03:36,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-07 14:03:36,117 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-07 14:03:36,118 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-07 14:03:36,120 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/square_1.yml/witness.yml [2024-08-07 14:03:36,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-07 14:03:36,184 INFO L274 PluginConnector]: CDTParser initialized [2024-08-07 14:03:36,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-cdfpl/square_1.i [2024-08-07 14:03:37,841 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-07 14:03:38,046 INFO L384 CDTParser]: Found 1 translation units. [2024-08-07 14:03:38,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-cdfpl/square_1.i [2024-08-07 14:03:38,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e67b1a36/896d0a1850d74b2cb3f3c04a24c6d5ad/FLAG245f122d3 [2024-08-07 14:03:38,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e67b1a36/896d0a1850d74b2cb3f3c04a24c6d5ad [2024-08-07 14:03:38,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-07 14:03:38,439 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-07 14:03:38,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-07 14:03:38,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-07 14:03:38,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-07 14:03:38,448 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:36" (1/2) ... [2024-08-07 14:03:38,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fb98854 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:38, skipping insertion in model container [2024-08-07 14:03:38,449 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:36" (1/2) ... [2024-08-07 14:03:38,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1daa92da and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:03:38, skipping insertion in model container [2024-08-07 14:03:38,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:03:38" (2/2) ... [2024-08-07 14:03:38,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fb98854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:38, skipping insertion in model container [2024-08-07 14:03:38,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:03:38" (2/2) ... [2024-08-07 14:03:38,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-07 14:03:38,643 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/square_1.i[1626,1639] [2024-08-07 14:03:38,647 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:03:38,668 INFO L200 MainTranslator]: Completed pre-run [2024-08-07 14:03:38,683 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/square_1.i[1626,1639] [2024-08-07 14:03:38,685 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:03:38,706 INFO L204 MainTranslator]: Completed translation [2024-08-07 14:03:38,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:38 WrapperNode [2024-08-07 14:03:38,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-07 14:03:38,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-07 14:03:38,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-07 14:03:38,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-07 14:03:38,721 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:38" (1/1) ... [2024-08-07 14:03:38,721 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:38" (1/1) ... [2024-08-07 14:03:38,731 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:38" (1/1) ... [2024-08-07 14:03:38,748 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:38,749 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:38" (1/1) ... [2024-08-07 14:03:38,749 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:38" (1/1) ... [2024-08-07 14:03:38,759 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:38" (1/1) ... [2024-08-07 14:03:38,761 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:38" (1/1) ... [2024-08-07 14:03:38,763 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:38" (1/1) ... [2024-08-07 14:03:38,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-07 14:03:38,769 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-07 14:03:38,770 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-07 14:03:38,770 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-07 14:03:38,771 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:38" (1/1) ... [2024-08-07 14:03:38,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-07 14:03:38,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-07 14:03:38,803 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:38,806 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:38,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-07 14:03:38,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-07 14:03:38,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2024-08-07 14:03:38,852 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-07 14:03:38,852 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-08-07 14:03:38,853 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-07 14:03:38,853 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-07 14:03:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-07 14:03:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2024-08-07 14:03:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2024-08-07 14:03:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-07 14:03:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-07 14:03:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-08-07 14:03:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2024-08-07 14:03:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-07 14:03:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-07 14:03:38,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-08-07 14:03:38,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-07 14:03:38,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2024-08-07 14:03:38,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-08-07 14:03:38,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-08-07 14:03:38,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-07 14:03:38,946 INFO L273 CfgBuilder]: Building ICFG [2024-08-07 14:03:38,955 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-07 14:03:51,249 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-08-07 14:03:51,250 INFO L327 CfgBuilder]: Performing block encoding [2024-08-07 14:03:51,257 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-07 14:03:51,258 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-07 14:03:51,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:03:51 BoogieIcfgContainer [2024-08-07 14:03:51,259 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-07 14:03:51,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-07 14:03:51,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-07 14:03:51,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-07 14:03:51,266 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:36" (1/4) ... [2024-08-07 14:03:51,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213bab00 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 02:03:51, skipping insertion in model container [2024-08-07 14:03:51,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.08 02:03:38" (2/4) ... [2024-08-07 14:03:51,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213bab00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 02:03:51, skipping insertion in model container [2024-08-07 14:03:51,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:03:38" (3/4) ... [2024-08-07 14:03:51,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213bab00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 02:03:51, skipping insertion in model container [2024-08-07 14:03:51,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:03:51" (4/4) ... [2024-08-07 14:03:51,272 INFO L119 eAbstractionObserver]: Analyzing ICFG square_1.i [2024-08-07 14:03:51,274 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:51,295 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-07 14:03:51,296 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-07 14:03:51,334 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,335 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,335 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,336 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,338 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,339 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,340 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,340 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,341 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,341 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,344 WARN L283 nessProductAutomaton]: assume !(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated false [2024-08-07 14:03:51,344 WARN L283 nessProductAutomaton]: assume !!(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated true [2024-08-07 14:03:51,345 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,345 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,346 WARN L283 nessProductAutomaton]: assume !(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated false [2024-08-07 14:03:51,346 WARN L283 nessProductAutomaton]: assume !!(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated true [2024-08-07 14:03:51,346 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,346 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,347 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,347 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,349 WARN L283 nessProductAutomaton]: assume !(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated false [2024-08-07 14:03:51,349 WARN L283 nessProductAutomaton]: assume !!(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated true [2024-08-07 14:03:51,349 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,349 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,350 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,350 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,351 WARN L283 nessProductAutomaton]: assume !(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated false [2024-08-07 14:03:51,351 WARN L283 nessProductAutomaton]: assume !!(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated true [2024-08-07 14:03:51,352 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,352 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,353 WARN L283 nessProductAutomaton]: assume !(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated false [2024-08-07 14:03:51,353 WARN L283 nessProductAutomaton]: assume !!(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated true [2024-08-07 14:03:51,353 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,353 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,354 WARN L283 nessProductAutomaton]: assume !(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated false [2024-08-07 14:03:51,354 WARN L283 nessProductAutomaton]: assume !!(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated true [2024-08-07 14:03:51,355 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,355 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,356 WARN L283 nessProductAutomaton]: assume !(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated false [2024-08-07 14:03:51,356 WARN L283 nessProductAutomaton]: assume !!(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated true [2024-08-07 14:03:51,362 INFO L90 WitnessUtils]: NestedWordAutomaton nwa = ( callAlphabet = {"call #t~ret2 := main();" "call ULTIMATE.init();" "call assume_abort_if_not((if ~fp.geq~32(~IN~0, ~Pluszero~32()) && ~fp.lt~32(~IN~0, ~to_fp~32(currentRoundingMode, 1.0)) then 1bv32 else 0bv32));" }, internalAlphabet = {"assume 0bv32 == ~cond;assume false;" "assume !(0bv32 == ~cond);" "~cond := #in~cond;" "assume true;" "#res := 0bv32;" "assume false;" "assume !false;" "assume !(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));" "assume !!(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));" "~x~0 := ~IN~0;~result~0 := ~fp.sub~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1.0), ~fp.mul~32(currentRoundingMode, ~to_fp~32(currentRoundingMode, 0.5), ~x~0)), ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~to_fp~32(currentRoundingMode, 0.125), ~x~0), ~x~0)), ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~to_fp~32(currentRoundingMode, 0.0625), ~x~0), ~x~0), ~x~0)), ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~to_fp~32(currentRoundingMode, 0.0390625), ~x~0), ~x~0), ~x~0), ~x~0));" "SUMMARY for call assume_abort_if_not((if ~fp.geq~32(~IN~0, ~Pluszero~32()) && ~fp.lt~32(~IN~0, ~to_fp~32(currentRoundingMode, 1.0)) then 1bv32 else 0bv32)); srcloc: L30-1" "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(11bv32, 2bv32);" "assume true;" "SUMMARY for call #t~ret2 := main(); srcloc: L-1" "SUMMARY for call ULTIMATE.init(); srcloc: ULTIMATE.startENTRY" "assume true;" }, returnAlphabet = {"#33#return;" "#35#return;" "#31#return;" }, states = {"CountingPredicate [underlying: 9#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 14#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 8#L37true, annotation: [1, 0]]" "CountingPredicate [underlying: 19#L24true, annotation: [1, 0]]" "CountingPredicate [underlying: 14#assume_abort_if_notEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 8#L37true, annotation: [3, 0]]" "CountingPredicate [underlying: 3#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 10#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 10#assume_abort_if_notFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 5#mainENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 4#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 12#L38true, annotation: [1, 0]]" "CountingPredicate [underlying: 16#mainFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 11#L30-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 13#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 17#L40true, annotation: [5, 0]]" "CountingPredicate [underlying: 16#mainFINALtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 12#L38true, annotation: [4, 0]]" "CountingPredicate [underlying: 17#L40true, annotation: [3, 0]]" "CountingPredicate [underlying: 16#mainFINALtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 17#L40true, annotation: [1, 0]]" "CountingPredicate [underlying: 13#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 18#assume_abort_if_notENTRYtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 20#L30true, annotation: [3, 0]]" "CountingPredicate [underlying: 20#L30true, annotation: [1, 0]]" "CountingPredicate [underlying: 15#mainEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 15#mainEXITtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 15#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 7#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 21#ULTIMATE.startFINALtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 21#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 21#ULTIMATE.startFINALtrue, annotation: [5, 0]]" }, initialStates = {"CountingPredicate [underlying: 4#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" }, finalStates = {"CountingPredicate [underlying: 13#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [5, 0]]" }, callTransitions = { ("CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "call #t~ret2 := main();" "CountingPredicate [underlying: 5#mainENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 4#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "call ULTIMATE.init();" "CountingPredicate [underlying: 3#ULTIMATE.initENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 11#L30-1true, annotation: [0, 0]]" "call assume_abort_if_not((if ~fp.geq~32(~IN~0, ~Pluszero~32()) && ~fp.lt~32(~IN~0, ~to_fp~32(currentRoundingMode, 1.0)) then 1bv32 else 0bv32));" "CountingPredicate [underlying: 18#assume_abort_if_notENTRYtrue, annotation: [1, 0]]") }, internalTransitions = { ("CountingPredicate [underlying: 8#L37true, annotation: [1, 0]]" "assume !(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));" "CountingPredicate [underlying: 12#L38true, annotation: [1, 0]]") ("CountingPredicate [underlying: 8#L37true, annotation: [1, 0]]" "assume !!(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));" "CountingPredicate [underlying: 17#L40true, annotation: [1, 0]]") ("CountingPredicate [underlying: 19#L24true, annotation: [1, 0]]" "assume 0bv32 == ~cond;assume false;" "CountingPredicate [underlying: 10#assume_abort_if_notFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 19#L24true, annotation: [1, 0]]" "assume !(0bv32 == ~cond);" "CountingPredicate [underlying: 10#assume_abort_if_notFINALtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 8#L37true, annotation: [3, 0]]" "assume !(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));" "CountingPredicate [underlying: 12#L38true, annotation: [4, 0]]") ("CountingPredicate [underlying: 8#L37true, annotation: [3, 0]]" "assume !!(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));" "CountingPredicate [underlying: 17#L40true, annotation: [3, 0]]") ("CountingPredicate [underlying: 3#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(11bv32, 2bv32);" "CountingPredicate [underlying: 7#ULTIMATE.initFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 10#assume_abort_if_notFINALtrue, annotation: [2, 0]]" "assume true;" "CountingPredicate [underlying: 14#assume_abort_if_notEXITtrue, annotation: [2, 0]]") ("CountingPredicate [underlying: 10#assume_abort_if_notFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 14#assume_abort_if_notEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 5#mainENTRYtrue, annotation: [0, 0]]" "havoc #t~nondet1;~IN~0 := #t~nondet1;havoc #t~nondet1;" "CountingPredicate [underlying: 11#L30-1true, annotation: [0, 0]]") ("CountingPredicate [underlying: 12#L38true, annotation: [1, 0]]" "assume false;" "CountingPredicate [underlying: 17#L40true, annotation: [1, 0]]") ("CountingPredicate [underlying: 12#L38true, annotation: [1, 0]]" "assume !false;" "CountingPredicate [underlying: 13#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 16#mainFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 15#mainEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 17#L40true, annotation: [5, 0]]" "#res := 0bv32;" "CountingPredicate [underlying: 16#mainFINALtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 16#mainFINALtrue, annotation: [3, 0]]" "assume true;" "CountingPredicate [underlying: 15#mainEXITtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 12#L38true, annotation: [4, 0]]" "assume false;" "CountingPredicate [underlying: 17#L40true, annotation: [5, 0]]") ("CountingPredicate [underlying: 12#L38true, annotation: [4, 0]]" "assume !false;" "CountingPredicate [underlying: 13#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 17#L40true, annotation: [3, 0]]" "#res := 0bv32;" "CountingPredicate [underlying: 16#mainFINALtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 16#mainFINALtrue, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 15#mainEXITtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 17#L40true, annotation: [1, 0]]" "#res := 0bv32;" "CountingPredicate [underlying: 16#mainFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 18#assume_abort_if_notENTRYtrue, annotation: [1, 0]]" "~cond := #in~cond;" "CountingPredicate [underlying: 19#L24true, annotation: [1, 0]]") ("CountingPredicate [underlying: 20#L30true, annotation: [3, 0]]" "~x~0 := ~IN~0;~result~0 := ~fp.sub~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1.0), ~fp.mul~32(currentRoundingMode, ~to_fp~32(currentRoundingMode, 0.5), ~x~0)), ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~to_fp~32(currentRoundingMode, 0.125), ~x~0), ~x~0)), ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~to_fp~32(currentRoundingMode, 0.0625), ~x~0), ~x~0), ~x~0)), ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~to_fp~32(currentRoundingMode, 0.0390625), ~x~0), ~x~0), ~x~0), ~x~0));" "CountingPredicate [underlying: 8#L37true, annotation: [3, 0]]") ("CountingPredicate [underlying: 20#L30true, annotation: [1, 0]]" "~x~0 := ~IN~0;~result~0 := ~fp.sub~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~fp.sub~32(currentRoundingMode, ~fp.add~32(currentRoundingMode, ~to_fp~32(currentRoundingMode, 1.0), ~fp.mul~32(currentRoundingMode, ~to_fp~32(currentRoundingMode, 0.5), ~x~0)), ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~to_fp~32(currentRoundingMode, 0.125), ~x~0), ~x~0)), ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~to_fp~32(currentRoundingMode, 0.0625), ~x~0), ~x~0), ~x~0)), ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~fp.mul~32(currentRoundingMode, ~to_fp~32(currentRoundingMode, 0.0390625), ~x~0), ~x~0), ~x~0), ~x~0));" "CountingPredicate [underlying: 8#L37true, annotation: [1, 0]]") ("CountingPredicate [underlying: 7#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 9#ULTIMATE.initEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 21#ULTIMATE.startFINALtrue, annotation: [3, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 21#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 21#ULTIMATE.startFINALtrue, annotation: [5, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [5, 0]]") }, returnTransitions = { ("CountingPredicate [underlying: 9#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 4#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "#35#return;" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]") ("CountingPredicate [underlying: 14#assume_abort_if_notEXITtrue, annotation: [2, 0]]" "CountingPredicate [underlying: 11#L30-1true, annotation: [0, 0]]" "#31#return;" "CountingPredicate [underlying: 20#L30true, annotation: [3, 0]]") ("CountingPredicate [underlying: 14#assume_abort_if_notEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 11#L30-1true, annotation: [0, 0]]" "#31#return;" "CountingPredicate [underlying: 20#L30true, annotation: [1, 0]]") ("CountingPredicate [underlying: 15#mainEXITtrue, annotation: [5, 0]]" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "#33#return;" "CountingPredicate [underlying: 21#ULTIMATE.startFINALtrue, annotation: [5, 0]]") ("CountingPredicate [underlying: 15#mainEXITtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "#33#return;" "CountingPredicate [underlying: 21#ULTIMATE.startFINALtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 15#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 6#L-1true, annotation: [0, 0]]" "#33#return;" "CountingPredicate [underlying: 21#ULTIMATE.startFINALtrue, annotation: [1, 0]]") } ); [2024-08-07 14:03:51,368 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 20 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-08-07 14:03:51,370 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,370 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,371 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,371 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,372 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,372 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,373 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,373 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,374 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,374 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,374 WARN L283 nessProductAutomaton]: assume !(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated false [2024-08-07 14:03:51,374 WARN L283 nessProductAutomaton]: assume !!(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated true [2024-08-07 14:03:51,375 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,375 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,375 WARN L283 nessProductAutomaton]: assume !(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated false [2024-08-07 14:03:51,376 WARN L283 nessProductAutomaton]: assume !!(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated true [2024-08-07 14:03:51,376 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,376 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,377 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,377 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,377 WARN L283 nessProductAutomaton]: assume !(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated false [2024-08-07 14:03:51,378 WARN L283 nessProductAutomaton]: assume !!(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated true [2024-08-07 14:03:51,378 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,378 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,379 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,379 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,379 WARN L283 nessProductAutomaton]: assume !(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated false [2024-08-07 14:03:51,380 WARN L283 nessProductAutomaton]: assume !!(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated true [2024-08-07 14:03:51,380 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,380 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,381 WARN L283 nessProductAutomaton]: assume !(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated false [2024-08-07 14:03:51,381 WARN L283 nessProductAutomaton]: assume !!(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated true [2024-08-07 14:03:51,381 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,381 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,382 WARN L283 nessProductAutomaton]: assume !(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated false [2024-08-07 14:03:51,382 WARN L283 nessProductAutomaton]: assume !!(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated true [2024-08-07 14:03:51,382 WARN L283 nessProductAutomaton]: assume 0bv32 == ~cond;assume false;, isNegated false [2024-08-07 14:03:51,382 WARN L283 nessProductAutomaton]: assume !(0bv32 == ~cond);, isNegated true [2024-08-07 14:03:51,383 WARN L283 nessProductAutomaton]: assume !(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated false [2024-08-07 14:03:51,383 WARN L283 nessProductAutomaton]: assume !!(~fp.geq~32(~result~0, ~Pluszero~32()) && ~fp.lt~32(~result~0, ~to_fp~32(currentRoundingMode, 1.39)));, isNegated true [2024-08-07 14:03:51,389 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 36 states to 15 states. [2024-08-07 14:03:51,411 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-07 14:03:51,417 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;@39b5ab32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-07 14:03:51,418 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-07 14:03:51,419 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2024-08-07 14:03:51,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-08-07 14:03:51,422 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 14:03:51,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-07 14:03:51,423 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 14:03:51,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 14:03:51,428 INFO L85 PathProgramCache]: Analyzing trace with hash -892701185, now seen corresponding path program 1 times [2024-08-07 14:03:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-08-07 14:03:51,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026850892] [2024-08-07 14:03:51,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 14:03:51,449 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:51,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-08-07 14:03:51,453 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:51,454 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:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 14:04:06,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-07 14:05:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 14:05:55,970 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-08-07 14:05:55,972 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-07 14:05:55,975 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-07 14:05:56,019 INFO L552 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)] Ended with exit code 0 [2024-08-07 14:05:56,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /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 [2024-08-07 14:05:56,182 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-07 14:05:56,185 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-07 14:05:56,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.08 02:05:56 BoogieIcfgContainer [2024-08-07 14:05:56,196 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-07 14:05:56,196 INFO L158 Benchmark]: Toolchain (without parser) took 137757.36ms. Allocated memory is still 62.9MB. Free memory was 44.6MB in the beginning and 36.2MB in the end (delta: 8.4MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-08-07 14:05:56,197 INFO L158 Benchmark]: Witness Parser took 0.29ms. Allocated memory is still 48.2MB. Free memory is still 29.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:05:56,197 INFO L158 Benchmark]: CDTParser took 0.89ms. Allocated memory is still 48.2MB. Free memory is still 27.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:05:56,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.66ms. Allocated memory is still 62.9MB. Free memory was 44.3MB in the beginning and 32.3MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-08-07 14:05:56,198 INFO L158 Benchmark]: Boogie Preprocessor took 59.81ms. Allocated memory is still 62.9MB. Free memory was 32.3MB in the beginning and 30.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-07 14:05:56,198 INFO L158 Benchmark]: IcfgBuilder took 12490.37ms. Allocated memory is still 62.9MB. Free memory was 29.9MB in the beginning and 36.8MB in the end (delta: -6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-08-07 14:05:56,199 INFO L158 Benchmark]: TraceAbstraction took 124932.96ms. Allocated memory is still 62.9MB. Free memory was 35.9MB in the beginning and 36.2MB in the end (delta: -241.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:05:56,202 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.29ms. Allocated memory is still 48.2MB. Free memory is still 29.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.89ms. Allocated memory is still 48.2MB. Free memory is still 27.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.66ms. Allocated memory is still 62.9MB. Free memory was 44.3MB in the beginning and 32.3MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.81ms. Allocated memory is still 62.9MB. Free memory was 32.3MB in the beginning and 30.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 12490.37ms. Allocated memory is still 62.9MB. Free memory was 29.9MB in the beginning and 36.8MB in the end (delta: -6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 124932.96ms. Allocated memory is still 62.9MB. Free memory was 35.9MB in the beginning and 36.2MB in the end (delta: -241.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 38]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L29] float IN = __VERIFIER_nondet_float(); [L30] CALL assume_abort_if_not(IN >= 0.0f && IN < 1.0f) VAL [\old(cond)=1] [L24] !cond VAL [\old(cond)=1] [L30] RET assume_abort_if_not(IN >= 0.0f && IN < 1.0f) VAL [IN=0.9959111213684082] [L32] float x = IN; [L34-L35] float result = 1.0f + 0.5f*x - 0.125f*x*x + 0.0625f*x*x*x - 0.0390625f*x*x*x*x; VAL [result=1.397284746170044] [L37] !(result >= 0.0f && result < 1.39f) [L38] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 124.9s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred 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, 15.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 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 proved your program to be incorrect! [2024-08-07 14:05:56,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE