./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 15:35:41,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 15:35:41,156 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-12-02 15:35:41,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 15:35:41,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 15:35:41,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 15:35:41,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 15:35:41,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 15:35:41,184 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 15:35:41,184 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 15:35:41,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 15:35:41,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 15:35:41,185 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 15:35:41,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 15:35:41,185 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 15:35:41,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 15:35:41,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 15:35:41,185 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 15:35:41,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 15:35:41,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 15:35:41,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 15:35:41,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 15:35:41,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 15:35:41,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 15:35:41,186 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 15:35:41,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 15:35:41,186 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 15:35:41,186 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 15:35:41,186 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 15:35:41,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 15:35:41,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 15:35:41,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 15:35:41,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:35:41,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 15:35:41,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 15:35:41,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 15:35:41,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 15:35:41,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:35:41,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 15:35:41,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 15:35:41,187 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 15:35:41,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 15:35:41,187 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-02 15:35:41,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-02 15:35:41,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 15:35:41,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 15:35:41,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 15:35:41,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 15:35:41,188 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 [2024-12-02 15:35:41,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 15:35:41,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 15:35:41,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 15:35:41,433 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 15:35:41,434 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 15:35:41,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2024-12-02 15:35:44,002 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/data/5b191c160/b4668f59d74e44d7a4670c5e209513ad/FLAG54d2df78a [2024-12-02 15:35:44,210 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 15:35:44,211 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2024-12-02 15:35:44,219 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/data/5b191c160/b4668f59d74e44d7a4670c5e209513ad/FLAG54d2df78a [2024-12-02 15:35:44,590 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/data/5b191c160/b4668f59d74e44d7a4670c5e209513ad [2024-12-02 15:35:44,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 15:35:44,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 15:35:44,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 15:35:44,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 15:35:44,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 15:35:44,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:35:44" (1/1) ... [2024-12-02 15:35:44,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6462c5fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:35:44, skipping insertion in model container [2024-12-02 15:35:44,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:35:44" (1/1) ... [2024-12-02 15:35:44,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 15:35:44,698 ERROR L321 MainTranslator]: Unsupported Syntax: floats in unions are not supported in the integer translation. [2024-12-02 15:35:44,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@58192d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:35:44, skipping insertion in model container [2024-12-02 15:35:44,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 15:35:44,699 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-12-02 15:35:44,701 INFO L158 Benchmark]: Toolchain (without parser) took 107.34ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 107.6MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 15:35:44,701 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 142.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-02 15:35:44,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 105.72ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 107.6MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-02 15:35:44,702 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 142.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 105.72ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 107.6MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 11]: Unsupported Syntax floats in unions are not supported in the integer translation. RESULT: Ultimate could not prove your program: Toolchain returned no result. 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: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 15:35:46,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 15:35:46,537 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-12-02 15:35:46,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 15:35:46,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 15:35:46,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 15:35:46,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 15:35:46,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 15:35:46,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 15:35:46,568 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 15:35:46,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-02 15:35:46,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-02 15:35:46,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 15:35:46,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 15:35:46,569 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 15:35:46,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 15:35:46,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-02 15:35:46,570 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-02 15:35:46,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-02 15:35:46,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 15:35:46,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-02 15:35:46,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-02 15:35:46,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-02 15:35:46,570 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-12-02 15:35:46,570 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-12-02 15:35:46,570 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-12-02 15:35:46,570 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-02 15:35:46,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 15:35:46,571 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 15:35:46,571 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 15:35:46,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-12-02 15:35:46,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 15:35:46,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 15:35:46,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 15:35:46,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:35:46,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 15:35:46,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 15:35:46,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-02 15:35:46,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-02 15:35:46,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:35:46,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 15:35:46,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-02 15:35:46,572 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-02 15:35:46,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-02 15:35:46,572 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-12-02 15:35:46,572 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-12-02 15:35:46,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-02 15:35:46,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-12-02 15:35:46,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-12-02 15:35:46,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-12-02 15:35:46,573 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 [2024-12-02 15:35:46,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 15:35:46,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 15:35:46,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 15:35:46,825 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 15:35:46,825 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 15:35:46,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2024-12-02 15:35:49,596 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/data/750cb20d8/23a36c0f2d964f78a5f0d0c7c746e79f/FLAG84014dd34 [2024-12-02 15:35:49,772 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 15:35:49,773 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2024-12-02 15:35:49,780 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/data/750cb20d8/23a36c0f2d964f78a5f0d0c7c746e79f/FLAG84014dd34 [2024-12-02 15:35:50,152 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/data/750cb20d8/23a36c0f2d964f78a5f0d0c7c746e79f [2024-12-02 15:35:50,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 15:35:50,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 15:35:50,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 15:35:50,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 15:35:50,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 15:35:50,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:35:50" (1/1) ... [2024-12-02 15:35:50,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a280f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:35:50, skipping insertion in model container [2024-12-02 15:35:50,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:35:50" (1/1) ... [2024-12-02 15:35:50,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 15:35:50,290 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2024-12-02 15:35:50,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 15:35:50,304 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 15:35:50,321 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2024-12-02 15:35:50,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 15:35:50,336 INFO L204 MainTranslator]: Completed translation [2024-12-02 15:35:50,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:35:50 WrapperNode [2024-12-02 15:35:50,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 15:35:50,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 15:35:50,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 15:35:50,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 15:35:50,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:35:50" (1/1) ... [2024-12-02 15:35:50,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:35:50" (1/1) ... [2024-12-02 15:35:50,363 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 103 [2024-12-02 15:35:50,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 15:35:50,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 15:35:50,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 15:35:50,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 15:35:50,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:35:50" (1/1) ... [2024-12-02 15:35:50,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:35:50" (1/1) ... [2024-12-02 15:35:50,372 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:35:50" (1/1) ... [2024-12-02 15:35:50,385 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2024-12-02 15:35:50,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:35:50" (1/1) ... [2024-12-02 15:35:50,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:35:50" (1/1) ... [2024-12-02 15:35:50,393 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:35:50" (1/1) ... [2024-12-02 15:35:50,393 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:35:50" (1/1) ... [2024-12-02 15:35:50,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:35:50" (1/1) ... [2024-12-02 15:35:50,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:35:50" (1/1) ... [2024-12-02 15:35:50,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:35:50" (1/1) ... [2024-12-02 15:35:50,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 15:35:50,401 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 15:35:50,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 15:35:50,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 15:35:50,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:35:50" (1/1) ... [2024-12-02 15:35:50,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-12-02 15:35:50,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 15:35:50,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-12-02 15:35:50,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-12-02 15:35:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-02 15:35:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-12-02 15:35:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-12-02 15:35:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-12-02 15:35:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-12-02 15:35:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-12-02 15:35:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-12-02 15:35:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-12-02 15:35:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-12-02 15:35:50,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-12-02 15:35:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-02 15:35:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-12-02 15:35:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-12-02 15:35:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-12-02 15:35:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 15:35:50,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 15:35:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-02 15:35:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-12-02 15:35:50,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-12-02 15:35:50,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-12-02 15:35:50,525 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 15:35:50,526 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 15:35:54,833 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-12-02 15:35:54,833 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 15:35:54,840 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 15:35:54,841 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-02 15:35:54,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:35:54 BoogieIcfgContainer [2024-12-02 15:35:54,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 15:35:54,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-02 15:35:54,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-02 15:35:54,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-02 15:35:54,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:35:50" (1/3) ... [2024-12-02 15:35:54,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e65dc8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:35:54, skipping insertion in model container [2024-12-02 15:35:54,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:35:50" (2/3) ... [2024-12-02 15:35:54,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e65dc8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:35:54, skipping insertion in model container [2024-12-02 15:35:54,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:35:54" (3/3) ... [2024-12-02 15:35:54,848 INFO L128 eAbstractionObserver]: Analyzing ICFG inv_Newton.c.p+cfa-reducer.c [2024-12-02 15:35:54,864 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-02 15:35:54,865 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG inv_Newton.c.p+cfa-reducer.c that has 1 procedures, 21 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-12-02 15:35:54,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-12-02 15:35:54,908 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@15857741, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-02 15:35:54,908 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-12-02 15:35:54,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:35:54,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-02 15:35:54,914 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:35:54,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:35:54,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:35:54,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:35:54,920 INFO L85 PathProgramCache]: Analyzing trace with hash -938930996, now seen corresponding path program 1 times [2024-12-02 15:35:54,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 15:35:54,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48497759] [2024-12-02 15:35:54,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:35:54,928 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-12-02 15:35:54,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 15:35:54,930 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 15:35:54,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 15:35:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:35:55,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 15:35:55,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:35:55,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:35:55,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:35:55,094 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 15:35:55,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48497759] [2024-12-02 15:35:55,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48497759] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:35:55,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:35:55,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 15:35:55,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576287204] [2024-12-02 15:35:55,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:35:55,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:35:55,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 15:35:55,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:35:55,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:35:55,119 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:35:59,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:36:03,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:36:07,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:36:07,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:36:07,494 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2024-12-02 15:36:07,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:36:07,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-12-02 15:36:07,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:36:07,550 INFO L225 Difference]: With dead ends: 32 [2024-12-02 15:36:07,551 INFO L226 Difference]: Without dead ends: 19 [2024-12-02 15:36:07,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:36:07,554 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-12-02 15:36:07,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2024-12-02 15:36:07,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-12-02 15:36:07,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-12-02 15:36:07,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:36:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2024-12-02 15:36:07,575 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2024-12-02 15:36:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:36:07,575 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-12-02 15:36:07,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:36:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2024-12-02 15:36:07,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-02 15:36:07,575 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:36:07,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:36:07,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 15:36:07,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 15:36:07,776 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:36:07,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:36:07,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1250925041, now seen corresponding path program 1 times [2024-12-02 15:36:07,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 15:36:07,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104061875] [2024-12-02 15:36:07,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:36:07,777 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-12-02 15:36:07,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 15:36:07,779 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 15:36:07,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-12-02 15:36:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:36:08,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-02 15:36:08,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:36:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-02 15:36:08,449 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:36:08,449 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 15:36:08,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104061875] [2024-12-02 15:36:08,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104061875] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:36:08,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:36:08,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 15:36:08,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753433245] [2024-12-02 15:36:08,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:36:08,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 15:36:08,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 15:36:08,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 15:36:08,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 15:36:08,452 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:36:12,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:36:16,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:36:20,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:36:24,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:36:28,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:36:28,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:36:28,825 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2024-12-02 15:36:28,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 15:36:28,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-12-02 15:36:28,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:36:28,876 INFO L225 Difference]: With dead ends: 28 [2024-12-02 15:36:28,876 INFO L226 Difference]: Without dead ends: 21 [2024-12-02 15:36:28,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 15:36:28,877 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2024-12-02 15:36:28,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 5 Unknown, 0 Unchecked, 20.4s Time] [2024-12-02 15:36:28,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-12-02 15:36:28,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-12-02 15:36:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:36:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-12-02 15:36:28,881 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 15 [2024-12-02 15:36:28,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:36:28,881 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-12-02 15:36:28,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:36:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2024-12-02 15:36:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-02 15:36:28,882 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:36:28,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:36:28,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-12-02 15:36:29,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 15:36:29,082 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:36:29,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:36:29,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1796523982, now seen corresponding path program 1 times [2024-12-02 15:36:29,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 15:36:29,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267610910] [2024-12-02 15:36:29,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:36:29,083 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-12-02 15:36:29,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 15:36:29,085 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 15:36:29,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-12-02 15:36:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:36:29,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 15:36:29,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:36:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 15:36:29,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:36:29,755 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 15:36:29,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267610910] [2024-12-02 15:36:29,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267610910] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:36:29,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:36:29,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-02 15:36:29,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950143972] [2024-12-02 15:36:29,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:36:29,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-12-02 15:36:29,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 15:36:29,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 15:36:29,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 15:36:29,757 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:36:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:36:29,815 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-12-02 15:36:29,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 15:36:29,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-12-02 15:36:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:36:29,816 INFO L225 Difference]: With dead ends: 24 [2024-12-02 15:36:29,816 INFO L226 Difference]: Without dead ends: 20 [2024-12-02 15:36:29,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-12-02 15:36:29,817 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-12-02 15:36:29,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-12-02 15:36:29,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-12-02 15:36:29,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-12-02 15:36:29,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:36:29,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-12-02 15:36:29,820 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2024-12-02 15:36:29,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:36:29,821 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-12-02 15:36:29,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:36:29,821 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-12-02 15:36:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-02 15:36:29,821 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:36:29,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:36:29,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-12-02 15:36:30,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 15:36:30,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:36:30,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:36:30,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1813534643, now seen corresponding path program 1 times [2024-12-02 15:36:30,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 15:36:30,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432835049] [2024-12-02 15:36:30,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:36:30,023 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-12-02 15:36:30,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 15:36:30,025 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 15:36:30,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-12-02 15:36:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:36:30,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-12-02 15:36:30,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:36:39,344 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:36:47,530 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:36:55,723 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:37:03,920 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:37:12,115 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:37:16,182 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0) |c_ULTIMATE.start_main_~inv__temp~0#1|) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8))) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0)) |c_ULTIMATE.start_main_~inv__xsi~0#1|)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 15:37:24,316 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:37:32,512 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:37:38,684 WARN L286 SmtUtils]: Spent 6.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:37:46,888 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:37:55,088 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:37:59,175 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0) |c_ULTIMATE.start_main_~inv__temp~0#1|) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8))) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0)) |c_ULTIMATE.start_main_~inv__xsi~0#1|)))) (not (fp.gt |c_ULTIMATE.start_main_~inv__temp~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 15:38:07,403 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:38:15,531 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:38:23,743 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:38:31,951 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:38:40,243 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:38:48,458 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:38:52,527 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse2)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (not (fp.gt .cse0 .cse1)) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8))) (not (fp.lt .cse0 (fp.neg .cse1))) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse2) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse2) .cse2)) |c_ULTIMATE.start_main_~inv__xsi~0#1|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 15:39:00,832 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:39:09,046 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:39:17,276 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:39:25,528 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:39:33,785 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:39:42,035 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:39:46,110 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse3) .cse3)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (= .cse0 |c_ULTIMATE.start_main_~inv__xi~0#1|) (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (not (fp.gt .cse1 .cse2)) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (not (fp.lt .cse1 (fp.neg .cse2))) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 15:39:54,368 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:40:02,615 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:40:10,871 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:40:19,156 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:40:27,437 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:40:35,655 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:40:39,741 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse3) .cse3)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (not (fp.gt .cse0 .cse1)) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (not (fp.lt .cse0 (fp.neg .cse1))) (= .cse2 |c_ULTIMATE.start_main_~main__r~0#1|) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 15:40:52,097 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:41:00,369 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:41:05,714 WARN L286 SmtUtils]: Spent 5.34s on a formula simplification. DAG size of input: 26 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:41:13,957 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:41:22,202 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:41:30,452 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:41:34,515 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~inv__A~0#1| .cse1) .cse1)))) (and (not (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 20.0)))))) is different from false [2024-12-02 15:41:38,561 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~inv__A~0#1| .cse1) .cse1)))) (and (not (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 20.0)))))) is different from true [2024-12-02 15:41:50,896 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:41:59,147 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:42:07,408 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:42:15,645 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:42:23,901 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:42:36,209 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:42:44,448 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:42:52,681 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:43:00,925 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:43:09,169 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:43:21,484 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:43:29,752 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:43:37,993 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:43:46,242 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:43:54,492 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:43:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-12-02 15:43:54,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 15:44:03,920 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:44:12,196 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:44:20,485 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:44:24,562 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~inv__xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~inv__A~0#1| |c_ULTIMATE.start_main_~inv__xi~0#1|) |c_ULTIMATE.start_main_~inv__xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~inv__xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.gt .cse0 .cse1) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.lt .cse0 (fp.neg .cse1))))) is different from false [2024-12-02 15:44:28,634 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~inv__xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~inv__A~0#1| |c_ULTIMATE.start_main_~inv__xi~0#1|) |c_ULTIMATE.start_main_~inv__xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~inv__xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.gt .cse0 .cse1) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.lt .cse0 (fp.neg .cse1))))) is different from true [2024-12-02 15:44:36,913 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:44:45,179 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:44:56,762 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:45:01,243 WARN L873 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8)))) (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))))))) is different from true [2024-12-02 15:45:09,520 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:45:17,782 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:45:26,036 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:45:30,131 WARN L873 $PredicateComparison]: unable to prove that (or (forall ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8)))) (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))))))) (not (fp.leq |c_ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)))) is different from true [2024-12-02 15:45:38,436 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:45:46,701 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:45:54,960 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:45:59,031 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__a~0#1| (_ FloatingPoint 11 53))) (or (not (fp.leq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (forall ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8)))))))) (not (fp.geq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0))))) is different from false [2024-12-02 15:46:03,110 WARN L873 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__a~0#1| (_ FloatingPoint 11 53))) (or (not (fp.leq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (forall ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8)))))))) (not (fp.geq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0))))) is different from true [2024-12-02 15:46:11,413 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:46:19,667 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:46:27,920 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:46:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-12-02 15:46:27,946 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 15:46:27,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432835049] [2024-12-02 15:46:27,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432835049] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 15:46:27,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-02 15:46:27,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2024-12-02 15:46:27,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755774988] [2024-12-02 15:46:27,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-02 15:46:27,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-12-02 15:46:27,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 15:46:27,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-12-02 15:46:27,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=90, Unknown=13, NotChecked=270, Total=420 [2024-12-02 15:46:27,948 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:46:32,070 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~main__a~0#1| (_ FloatingPoint 11 53))) (or (not (fp.leq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (forall ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8)))))))) (not (fp.geq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 15:46:36,148 WARN L873 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~main__a~0#1| (_ FloatingPoint 11 53))) (or (not (fp.leq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (forall ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8)))))))) (not (fp.geq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-12-02 15:46:40,243 WARN L873 $PredicateComparison]: unable to prove that (and (or (forall ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8)))) (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))))))) (not (fp.leq |c_ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)))) (fp.geq |c_ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-12-02 15:46:47,022 WARN L873 $PredicateComparison]: unable to prove that (and (forall ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8)))) (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))))))) (fp.geq |c_ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq |c_ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-12-02 15:46:51,092 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~inv__xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~inv__A~0#1| |c_ULTIMATE.start_main_~inv__xi~0#1|) |c_ULTIMATE.start_main_~inv__xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~inv__xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.gt .cse0 .cse1) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.lt .cse0 (fp.neg .cse1))))) (fp.leq |c_ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (fp.geq |c_ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (and (= (let ((.cse3 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) |c_ULTIMATE.start_main_~inv__xi~0#1|) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 15:46:55,181 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~inv__xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~inv__A~0#1| |c_ULTIMATE.start_main_~inv__xi~0#1|) |c_ULTIMATE.start_main_~inv__xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~inv__xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.gt .cse0 .cse1) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.lt .cse0 (fp.neg .cse1))))) (fp.leq |c_ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (fp.geq |c_ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (and (= (let ((.cse3 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) |c_ULTIMATE.start_main_~inv__xi~0#1|) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-12-02 15:46:59,333 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0) |c_ULTIMATE.start_main_~inv__temp~0#1|) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8))) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0)) |c_ULTIMATE.start_main_~inv__xsi~0#1|)))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.gt |c_ULTIMATE.start_main_~inv__temp~0#1| .cse2) (fp.geq |c_ULTIMATE.start_main_~inv__xsi~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.lt |c_ULTIMATE.start_main_~inv__temp~0#1| (fp.neg .cse2)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 15:47:03,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:47:07,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:47:11,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:47:15,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:47:19,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:47:23,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:47:27,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:47:31,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:47:35,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:47:39,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:47:43,724 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0) |c_ULTIMATE.start_main_~inv__temp~0#1|) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8))) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0)) |c_ULTIMATE.start_main_~inv__xsi~0#1|)))) (or (fp.geq |c_ULTIMATE.start_main_~inv__xsi~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.lt |c_ULTIMATE.start_main_~inv__temp~0#1| (fp.neg .cse2))) (not (fp.gt |c_ULTIMATE.start_main_~inv__temp~0#1| .cse2)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-12-02 15:47:47,937 WARN L851 $PredicateComparison]: unable to prove that (and (fp.geq |c_ULTIMATE.start_main_~inv__xsi~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse2)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (not (fp.gt .cse0 .cse1)) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8))) (not (fp.lt .cse0 (fp.neg .cse1))) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse2) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse2) .cse2)) |c_ULTIMATE.start_main_~inv__xsi~0#1|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 15:47:52,191 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse3) .cse3)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (= .cse0 |c_ULTIMATE.start_main_~inv__xi~0#1|) (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (not (fp.gt .cse1 .cse2)) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (not (fp.lt .cse1 (fp.neg .cse2))) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8)))))))) (fp.geq |c_ULTIMATE.start_main_~inv__xi~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 15:47:56,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:48:00,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-12-02 15:48:04,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:48:08,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:48:12,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:48:16,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:48:20,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:48:24,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:48:28,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-12-02 15:48:32,587 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_ULTIMATE.start_main_~inv__exp~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_10|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse3) .cse3)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (not (fp.gt .cse0 .cse1)) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (not (fp.lt .cse0 (fp.neg .cse1))) (= .cse2 |c_ULTIMATE.start_main_~main__r~0#1|) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8)))))))) (fp.geq |c_ULTIMATE.start_main_~main__r~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 15:48:32,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:48:32,861 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-12-02 15:48:32,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-12-02 15:48:32,863 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-12-02 15:48:32,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:48:32,865 INFO L225 Difference]: With dead ends: 34 [2024-12-02 15:48:32,865 INFO L226 Difference]: Without dead ends: 29 [2024-12-02 15:48:32,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 102.2s TimeCoverageRelationStatistics Valid=65, Invalid=97, Unknown=24, NotChecked=684, Total=870 [2024-12-02 15:48:32,867 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 447 IncrementalHoareTripleChecker+Unchecked, 77.1s IncrementalHoareTripleChecker+Time [2024-12-02 15:48:32,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 19 Unknown, 447 Unchecked, 77.1s Time] [2024-12-02 15:48:32,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-12-02 15:48:32,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-12-02 15:48:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:48:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-12-02 15:48:32,872 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 15 [2024-12-02 15:48:32,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:48:32,872 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-12-02 15:48:32,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:48:32,873 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-12-02 15:48:32,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-02 15:48:32,873 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:48:32,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:48:32,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-12-02 15:48:33,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 15:48:33,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:48:33,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:48:33,075 INFO L85 PathProgramCache]: Analyzing trace with hash 556119512, now seen corresponding path program 1 times [2024-12-02 15:48:33,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 15:48:33,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978933596] [2024-12-02 15:48:33,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:48:33,075 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-12-02 15:48:33,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 15:48:33,077 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 15:48:33,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/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 (6)] Waiting until timeout for monitored process [2024-12-02 15:48:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:48:33,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 15:48:33,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:48:33,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-02 15:48:33,859 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-02 15:48:33,859 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-02 15:48:33,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978933596] [2024-12-02 15:48:33,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978933596] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-02 15:48:33,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-02 15:48:33,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-12-02 15:48:33,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843222997] [2024-12-02 15:48:33,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-02 15:48:33,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-02 15:48:33,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-02 15:48:33,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-02 15:48:33,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:48:33,860 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:48:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 15:48:33,908 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2024-12-02 15:48:33,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-02 15:48:33,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-12-02 15:48:33,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-12-02 15:48:33,911 INFO L225 Difference]: With dead ends: 41 [2024-12-02 15:48:33,911 INFO L226 Difference]: Without dead ends: 25 [2024-12-02 15:48:33,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-02 15:48:33,912 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-12-02 15:48:33,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-12-02 15:48:33,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-12-02 15:48:33,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-12-02 15:48:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:48:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-12-02 15:48:33,916 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 15 [2024-12-02 15:48:33,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-12-02 15:48:33,916 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-12-02 15:48:33,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 15:48:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-12-02 15:48:33,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-02 15:48:33,917 INFO L210 NwaCegarLoop]: Found error trace [2024-12-02 15:48:33,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-12-02 15:48:33,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/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 (6)] Ended with exit code 0 [2024-12-02 15:48:34,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 15:48:34,117 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-12-02 15:48:34,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 15:48:34,118 INFO L85 PathProgramCache]: Analyzing trace with hash -131847844, now seen corresponding path program 1 times [2024-12-02 15:48:34,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-02 15:48:34,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403461264] [2024-12-02 15:48:34,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 15:48:34,118 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-12-02 15:48:34,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/mathsat [2024-12-02 15:48:34,120 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/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-12-02 15:48:34,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_df083a28-c25b-4ce4-8ad7-0998a769b6df/bin/uautomizer-verify-84ZbGMXZE1/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 (7)] Waiting until timeout for monitored process [2024-12-02 15:48:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 15:48:36,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-02 15:48:36,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 15:48:36,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 60 [2024-12-02 15:48:36,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2024-12-02 15:48:45,391 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:48:53,575 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:49:01,848 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:49:10,121 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:49:14,233 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (concat v_arrayElimCell_1 (bvshl (bvadd (bvneg (bvadd (_ bv4294966273 32) (bvashr (bvand v_arrayElimCell_2 (_ bv2146435072 32)) (_ bv20 32)))) (_ bv1023 32)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0) |c_ULTIMATE.start_main_~inv__temp~0#1|) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0)) |c_ULTIMATE.start_main_~inv__xsi~0#1|)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 15:49:22,540 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:49:30,725 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:49:39,000 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:49:47,279 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:49:51,383 WARN L851 $PredicateComparison]: unable to prove that (and (not (fp.gt |c_ULTIMATE.start_main_~inv__temp~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (concat v_arrayElimCell_1 (bvshl (bvadd (bvneg (bvadd (_ bv4294966273 32) (bvashr (bvand v_arrayElimCell_2 (_ bv2146435072 32)) (_ bv20 32)))) (_ bv1023 32)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0) |c_ULTIMATE.start_main_~inv__temp~0#1|) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0)) |c_ULTIMATE.start_main_~inv__xsi~0#1|)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 15:49:59,590 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:50:07,864 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:50:16,144 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:50:24,425 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:50:32,706 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:50:36,815 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse2 (let ((.cse3 (concat v_arrayElimCell_1 (bvshl (bvadd (bvneg (bvadd (_ bv4294966273 32) (bvashr (bvand v_arrayElimCell_2 (_ bv2146435072 32)) (_ bv20 32)))) (_ bv1023 32)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse2)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse2) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse2) .cse2)) |c_ULTIMATE.start_main_~inv__xsi~0#1|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-12-02 15:50:45,114 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:50:53,393 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:51:01,669 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-02 15:51:09,867 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)