./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter2_alt.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_alt.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya --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 5bc48f0b37b49094aa2ed7125525fbb7b9a95c5af6fff8426a24c4fcf99bb295 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:16:03,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:16:03,758 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:16:03,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:16:03,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:16:03,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:16:03,786 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:16:03,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:16:03,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:16:03,788 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:16:03,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:16:03,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:16:03,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:16:03,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:16:03,791 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:16:03,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:16:03,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:16:03,792 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:16:03,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:16:03,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:16:03,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:16:03,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:16:03,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:16:03,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:16:03,796 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:16:03,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:16:03,797 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:16:03,798 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:16:03,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:16:03,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:16:03,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:16:03,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:16:03,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:16:03,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:16:03,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:16:03,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:16:03,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:16:03,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:16:03,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:16:03,801 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:16:03,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:16:03,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:16:03,802 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 5bc48f0b37b49094aa2ed7125525fbb7b9a95c5af6fff8426a24c4fcf99bb295 [2023-11-29 00:16:04,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:16:04,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:16:04,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:16:04,052 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:16:04,052 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:16:04,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/filter2_alt.c [2023-11-29 00:16:06,696 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:16:06,874 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:16:06,874 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/sv-benchmarks/c/float-benchs/filter2_alt.c [2023-11-29 00:16:06,882 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/data/df0964a83/b44aab202a40481d8897b1e12df8e377/FLAGf9f5c73ab [2023-11-29 00:16:06,896 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/data/df0964a83/b44aab202a40481d8897b1e12df8e377 [2023-11-29 00:16:06,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:16:06,900 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:16:06,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:16:06,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:16:06,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:16:06,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:16:06" (1/1) ... [2023-11-29 00:16:06,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@119737f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:06, skipping insertion in model container [2023-11-29 00:16:06,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:16:06" (1/1) ... [2023-11-29 00:16:06,925 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:16:07,061 WARN L240 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_08de604c-2a34-4b09-839b-2d81b8b238dc/sv-benchmarks/c/float-benchs/filter2_alt.c[631,644] [2023-11-29 00:16:07,093 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:16:07,104 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:16:07,116 WARN L240 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_08de604c-2a34-4b09-839b-2d81b8b238dc/sv-benchmarks/c/float-benchs/filter2_alt.c[631,644] [2023-11-29 00:16:07,123 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:16:07,138 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:16:07,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:07 WrapperNode [2023-11-29 00:16:07,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:16:07,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:16:07,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:16:07,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:16:07,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:07" (1/1) ... [2023-11-29 00:16:07,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:07" (1/1) ... [2023-11-29 00:16:07,175 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2023-11-29 00:16:07,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:16:07,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:16:07,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:16:07,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:16:07,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:07" (1/1) ... [2023-11-29 00:16:07,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:07" (1/1) ... [2023-11-29 00:16:07,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:07" (1/1) ... [2023-11-29 00:16:07,204 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 2]. The 6 writes are split as follows [0, 3, 3]. [2023-11-29 00:16:07,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:07" (1/1) ... [2023-11-29 00:16:07,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:07" (1/1) ... [2023-11-29 00:16:07,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:07" (1/1) ... [2023-11-29 00:16:07,216 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:07" (1/1) ... [2023-11-29 00:16:07,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:07" (1/1) ... [2023-11-29 00:16:07,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:07" (1/1) ... [2023-11-29 00:16:07,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:16:07,222 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:16:07,222 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:16:07,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:16:07,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:07" (1/1) ... [2023-11-29 00:16:07,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:16:07,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:16:07,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:16:07,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:16:07,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:16:07,283 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2023-11-29 00:16:07,283 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2023-11-29 00:16:07,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:16:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:16:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:16:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-29 00:16:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-29 00:16:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-11-29 00:16:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-29 00:16:07,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-29 00:16:07,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-11-29 00:16:07,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:16:07,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:16:07,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-11-29 00:16:07,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-11-29 00:16:07,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-11-29 00:16:07,383 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:16:07,385 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:16:07,485 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:16:07,511 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:16:07,511 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:16:07,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:16:07 BoogieIcfgContainer [2023-11-29 00:16:07,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:16:07,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:16:07,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:16:07,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:16:07,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:16:06" (1/3) ... [2023-11-29 00:16:07,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326bbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:16:07, skipping insertion in model container [2023-11-29 00:16:07,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:07" (2/3) ... [2023-11-29 00:16:07,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326bbd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:16:07, skipping insertion in model container [2023-11-29 00:16:07,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:16:07" (3/3) ... [2023-11-29 00:16:07,520 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_alt.c [2023-11-29 00:16:07,537 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:16:07,537 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:16:07,574 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:16:07,579 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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;@a6003f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:16:07,580 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:16:07,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:16:07,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 00:16:07,589 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:16:07,590 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:16:07,590 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:16:07,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:16:07,594 INFO L85 PathProgramCache]: Analyzing trace with hash 476706587, now seen corresponding path program 1 times [2023-11-29 00:16:07,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:16:07,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285938009] [2023-11-29 00:16:07,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:16:07,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:16:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:07,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:16:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:07,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:16:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 00:16:07,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:16:07,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285938009] [2023-11-29 00:16:07,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285938009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:16:07,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:16:07,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:16:07,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075802099] [2023-11-29 00:16:07,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:16:07,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:16:07,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:16:07,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:16:07,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:16:07,806 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:16:07,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:16:07,836 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2023-11-29 00:16:07,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:16:07,839 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-11-29 00:16:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:16:07,845 INFO L225 Difference]: With dead ends: 32 [2023-11-29 00:16:07,845 INFO L226 Difference]: Without dead ends: 16 [2023-11-29 00:16:07,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:16:07,852 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 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 [2023-11-29 00:16:07,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:16:07,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-29 00:16:07,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-29 00:16:07,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:16:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2023-11-29 00:16:07,889 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 17 [2023-11-29 00:16:07,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:16:07,889 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2023-11-29 00:16:07,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:16:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2023-11-29 00:16:07,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 00:16:07,891 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:16:07,891 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:16:07,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:16:07,892 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:16:07,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:16:07,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1240596699, now seen corresponding path program 1 times [2023-11-29 00:16:07,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:16:07,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495721153] [2023-11-29 00:16:07,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:16:07,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:16:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:07,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:16:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:08,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 00:16:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 00:16:08,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:16:08,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495721153] [2023-11-29 00:16:08,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495721153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:16:08,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:16:08,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:16:08,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967532187] [2023-11-29 00:16:08,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:16:08,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:16:08,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:16:08,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:16:08,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:16:08,018 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:16:08,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:16:08,044 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-11-29 00:16:08,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:16:08,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-11-29 00:16:08,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:16:08,046 INFO L225 Difference]: With dead ends: 38 [2023-11-29 00:16:08,046 INFO L226 Difference]: Without dead ends: 25 [2023-11-29 00:16:08,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:16:08,048 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:16:08,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 28 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:16:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-29 00:16:08,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-11-29 00:16:08,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:16:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2023-11-29 00:16:08,057 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2023-11-29 00:16:08,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:16:08,058 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2023-11-29 00:16:08,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:16:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2023-11-29 00:16:08,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 00:16:08,059 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:16:08,059 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:16:08,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:16:08,060 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:16:08,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:16:08,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1543740561, now seen corresponding path program 1 times [2023-11-29 00:16:08,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:16:08,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929663141] [2023-11-29 00:16:08,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:16:08,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:16:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:16:08,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:16:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:16:08,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:16:08,209 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:16:08,211 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 00:16:08,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:16:08,216 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-29 00:16:08,219 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:16:08,240 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-11-29 00:16:08,242 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated [2023-11-29 00:16:08,243 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated [2023-11-29 00:16:08,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:16:08 BoogieIcfgContainer [2023-11-29 00:16:08,255 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:16:08,255 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:16:08,255 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:16:08,256 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:16:08,256 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:16:07" (3/4) ... [2023-11-29 00:16:08,258 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 00:16:08,259 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:16:08,260 INFO L158 Benchmark]: Toolchain (without parser) took 1359.91ms. Allocated memory is still 163.6MB. Free memory was 129.6MB in the beginning and 128.9MB in the end (delta: 704.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:16:08,260 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 123.7MB. Free memory is still 94.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:16:08,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.09ms. Allocated memory is still 163.6MB. Free memory was 129.6MB in the beginning and 132.7MB in the end (delta: -3.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 00:16:08,261 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.24ms. Allocated memory is still 163.6MB. Free memory was 132.2MB in the beginning and 130.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:16:08,262 INFO L158 Benchmark]: Boogie Preprocessor took 45.15ms. Allocated memory is still 163.6MB. Free memory was 130.9MB in the beginning and 128.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:16:08,262 INFO L158 Benchmark]: RCFGBuilder took 289.66ms. Allocated memory is still 163.6MB. Free memory was 128.7MB in the beginning and 115.9MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 00:16:08,263 INFO L158 Benchmark]: TraceAbstraction took 740.80ms. Allocated memory is still 163.6MB. Free memory was 115.0MB in the beginning and 128.9MB in the end (delta: -13.9MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2023-11-29 00:16:08,263 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 163.6MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:16:08,266 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.15ms. Allocated memory is still 123.7MB. Free memory is still 94.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.09ms. Allocated memory is still 163.6MB. Free memory was 129.6MB in the beginning and 132.7MB in the end (delta: -3.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.24ms. Allocated memory is still 163.6MB. Free memory was 132.2MB in the beginning and 130.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.15ms. Allocated memory is still 163.6MB. Free memory was 130.9MB in the beginning and 128.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 289.66ms. Allocated memory is still 163.6MB. Free memory was 128.7MB in the beginning and 115.9MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 740.80ms. Allocated memory is still 163.6MB. Free memory was 115.0MB in the beginning and 128.9MB in the end (delta: -13.9MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 163.6MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 14]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 43, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L19] BOOLEAN INIT; [L20] float P, X; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; [L32] static float E[2], S[2]; [L52] CALL, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=0, P=0, S={5:0}, X=0] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -10.f && x <= 10.f) [L12] COND FALSE !(!cond) VAL [E={4:0}, INIT=0, P=0, S={5:0}, X=0, \old(cond)=1, cond=1] [L26] RET assume_abort_if_not(x >= -10.f && x <= 10.f) [L27] return x; [L52] RET, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=0, P=0, S={5:0}, X=0] [L52] X = RANDOM_INPUT() [L53] INIT = TRUE VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=64] [L54] COND TRUE \read(TRUE) VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=64] [L55] CALL, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=64] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -10.f && x <= 10.f) [L12] COND FALSE !(!cond) VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=64, \old(cond)=1, cond=1] [L26] RET assume_abort_if_not(x >= -10.f && x <= 10.f) [L27] return x; [L55] RET, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=1, P=0, S={5:0}, X=64] [L55] X = RANDOM_INPUT() [L56] CALL filter2 () [L33] COND TRUE \read(INIT) [L34] S[0] = X [L35] P = X [L36] E[0] = X VAL [E={4:0}, INIT=1, P=66, S={5:0}, X=66] [L46] EXPR E[0] [L46] E[1] = E[0] [L46] E[0] = X [L47] EXPR S[0] [L47] S[1] = S[0] [L47] S[0] = P [L56] RET filter2 () [L57] INIT = FALSE VAL [E={4:0}, INIT=0, P=66, S={5:0}, X=66] [L54] COND TRUE \read(TRUE) VAL [E={4:0}, INIT=0, P=66, S={5:0}, X=66] [L55] CALL, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=0, P=66, S={5:0}, X=66] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -10.f && x <= 10.f) [L12] COND FALSE !(!cond) VAL [E={4:0}, INIT=0, P=66, S={5:0}, X=66, \old(cond)=1, cond=1] [L26] RET assume_abort_if_not(x >= -10.f && x <= 10.f) [L27] return x; [L55] RET, EXPR RANDOM_INPUT() VAL [E={4:0}, INIT=0, P=66, S={5:0}, X=66] [L55] X = RANDOM_INPUT() [L56] CALL filter2 () [L33] COND FALSE !(\read(INIT)) [L39] EXPR E[0] [L40] EXPR E[1] [L41] EXPR S[0] [L42] EXPR S[1] [L38-L42] P = (((((0.4677826f * X) - (E[0] * 0.7700725f)) + (E[1] * 0.4344376f)) + (S[0] * 1.5419f)) - (S[1] * 0.6740477f)) [L43] CALL __VERIFIER_assert(P >= -15.f && P <= 15.f) [L14] COND TRUE !(cond) VAL [E={4:0}, INIT=0, S={5:0}, X=65, \old(cond)=0, cond=0] [L14] reach_error() VAL [E={4:0}, INIT=0, S={5:0}, X=65, \old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 31 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 40 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 8/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 00:16:08,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_alt.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya --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 5bc48f0b37b49094aa2ed7125525fbb7b9a95c5af6fff8426a24c4fcf99bb295 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:16:10,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:16:10,229 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 00:16:10,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:16:10,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:16:10,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:16:10,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:16:10,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:16:10,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:16:10,266 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:16:10,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:16:10,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:16:10,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:16:10,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:16:10,268 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:16:10,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:16:10,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:16:10,270 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:16:10,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:16:10,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:16:10,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:16:10,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:16:10,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:16:10,273 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:16:10,274 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 00:16:10,274 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 00:16:10,274 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:16:10,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:16:10,275 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:16:10,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:16:10,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:16:10,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:16:10,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:16:10,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:16:10,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:16:10,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:16:10,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:16:10,277 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 00:16:10,278 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 00:16:10,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:16:10,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:16:10,278 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:16:10,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:16:10,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:16:10,279 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 00:16:10,279 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 5bc48f0b37b49094aa2ed7125525fbb7b9a95c5af6fff8426a24c4fcf99bb295 [2023-11-29 00:16:10,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:16:10,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:16:10,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:16:10,568 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:16:10,569 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:16:10,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/filter2_alt.c [2023-11-29 00:16:13,362 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:16:13,542 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:16:13,542 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/sv-benchmarks/c/float-benchs/filter2_alt.c [2023-11-29 00:16:13,550 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/data/a3dbe138c/3eae0d9b4dec43e8ae717ac4215eafe4/FLAGdf90e9347 [2023-11-29 00:16:13,565 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/data/a3dbe138c/3eae0d9b4dec43e8ae717ac4215eafe4 [2023-11-29 00:16:13,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:16:13,569 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:16:13,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:16:13,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:16:13,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:16:13,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:16:13" (1/1) ... [2023-11-29 00:16:13,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@594ab70b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:13, skipping insertion in model container [2023-11-29 00:16:13,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:16:13" (1/1) ... [2023-11-29 00:16:13,600 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:16:13,770 WARN L240 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_08de604c-2a34-4b09-839b-2d81b8b238dc/sv-benchmarks/c/float-benchs/filter2_alt.c[631,644] [2023-11-29 00:16:13,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:16:13,818 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:16:13,834 WARN L240 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_08de604c-2a34-4b09-839b-2d81b8b238dc/sv-benchmarks/c/float-benchs/filter2_alt.c[631,644] [2023-11-29 00:16:13,845 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:16:13,870 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:16:13,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:13 WrapperNode [2023-11-29 00:16:13,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:16:13,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:16:13,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:16:13,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:16:13,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:13" (1/1) ... [2023-11-29 00:16:13,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:13" (1/1) ... [2023-11-29 00:16:13,917 INFO L138 Inliner]: procedures = 20, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 74 [2023-11-29 00:16:13,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:16:13,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:16:13,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:16:13,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:16:13,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:13" (1/1) ... [2023-11-29 00:16:13,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:13" (1/1) ... [2023-11-29 00:16:13,936 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:13" (1/1) ... [2023-11-29 00:16:13,952 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 2]. The 6 writes are split as follows [0, 3, 3]. [2023-11-29 00:16:13,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:13" (1/1) ... [2023-11-29 00:16:13,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:13" (1/1) ... [2023-11-29 00:16:13,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:13" (1/1) ... [2023-11-29 00:16:13,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:13" (1/1) ... [2023-11-29 00:16:13,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:13" (1/1) ... [2023-11-29 00:16:13,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:13" (1/1) ... [2023-11-29 00:16:13,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:16:13,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:16:13,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:16:13,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:16:13,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:13" (1/1) ... [2023-11-29 00:16:13,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:16:13,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:16:14,008 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:16:14,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:16:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:16:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2023-11-29 00:16:14,062 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2023-11-29 00:16:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-11-29 00:16:14,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-11-29 00:16:14,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2023-11-29 00:16:14,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 00:16:14,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 00:16:14,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 00:16:14,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-11-29 00:16:14,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-11-29 00:16:14,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2023-11-29 00:16:14,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:16:14,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:16:14,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-11-29 00:16:14,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-11-29 00:16:14,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2023-11-29 00:16:14,180 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:16:14,182 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:16:18,424 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:16:18,461 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:16:18,461 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:16:18,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:16:18 BoogieIcfgContainer [2023-11-29 00:16:18,462 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:16:18,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:16:18,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:16:18,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:16:18,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:16:13" (1/3) ... [2023-11-29 00:16:18,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c9448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:16:18, skipping insertion in model container [2023-11-29 00:16:18,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:16:13" (2/3) ... [2023-11-29 00:16:18,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c9448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:16:18, skipping insertion in model container [2023-11-29 00:16:18,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:16:18" (3/3) ... [2023-11-29 00:16:18,470 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_alt.c [2023-11-29 00:16:18,489 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:16:18,489 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:16:18,535 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:16:18,541 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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;@3250e2fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:16:18,541 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:16:18,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:16:18,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 00:16:18,551 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:16:18,552 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:16:18,552 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:16:18,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:16:18,557 INFO L85 PathProgramCache]: Analyzing trace with hash 476706587, now seen corresponding path program 1 times [2023-11-29 00:16:18,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:16:18,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072705409] [2023-11-29 00:16:18,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:16:18,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:16:18,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:16:18,610 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:16:18,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:16:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:19,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 00:16:19,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:16:19,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 00:16:19,045 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:16:19,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:16:19,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072705409] [2023-11-29 00:16:19,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072705409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:16:19,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:16:19,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:16:19,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214378002] [2023-11-29 00:16:19,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:16:19,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:16:19,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:16:19,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:16:19,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:16:19,076 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:16:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:16:19,112 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2023-11-29 00:16:19,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:16:19,115 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-11-29 00:16:19,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:16:19,120 INFO L225 Difference]: With dead ends: 32 [2023-11-29 00:16:19,120 INFO L226 Difference]: Without dead ends: 16 [2023-11-29 00:16:19,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:16:19,125 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 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 [2023-11-29 00:16:19,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:16:19,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-11-29 00:16:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-29 00:16:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:16:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2023-11-29 00:16:19,154 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 17 [2023-11-29 00:16:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:16:19,154 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2023-11-29 00:16:19,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:16:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2023-11-29 00:16:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 00:16:19,156 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:16:19,156 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:16:19,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/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)] Forceful destruction successful, exit code 0 [2023-11-29 00:16:19,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:16:19,358 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:16:19,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:16:19,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1240596699, now seen corresponding path program 1 times [2023-11-29 00:16:19,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:16:19,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580780915] [2023-11-29 00:16:19,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:16:19,361 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 [2023-11-29 00:16:19,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:16:19,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:16:19,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:16:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:19,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:16:19,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:16:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:16:19,859 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:16:19,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:16:19,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580780915] [2023-11-29 00:16:19,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580780915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:16:19,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:16:19,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:16:19,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89387980] [2023-11-29 00:16:19,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:16:19,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:16:19,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:16:19,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:16:19,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:16:19,863 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:16:24,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:16:24,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:16:24,170 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-11-29 00:16:24,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:16:24,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-11-29 00:16:24,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:16:24,235 INFO L225 Difference]: With dead ends: 38 [2023-11-29 00:16:24,235 INFO L226 Difference]: Without dead ends: 25 [2023-11-29 00:16:24,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:16:24,238 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:16:24,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 28 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2023-11-29 00:16:24,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-29 00:16:24,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-11-29 00:16:24,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:16:24,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2023-11-29 00:16:24,248 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2023-11-29 00:16:24,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:16:24,249 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2023-11-29 00:16:24,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:16:24,249 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2023-11-29 00:16:24,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 00:16:24,250 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:16:24,251 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:16:24,259 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:16:24,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:16:24,452 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:16:24,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:16:24,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1543740561, now seen corresponding path program 1 times [2023-11-29 00:16:24,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:16:24,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943073115] [2023-11-29 00:16:24,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:16:24,453 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 [2023-11-29 00:16:24,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:16:24,454 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:16:24,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:16:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:16:31,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 00:16:31,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:16:31,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:16:32,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:16:32,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 236 treesize of output 138 [2023-11-29 00:16:32,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 49 [2023-11-29 00:16:35,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:16:35,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 579 treesize of output 429 [2023-11-29 00:16:35,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:16:35,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 459 treesize of output 309 [2023-11-29 00:16:43,746 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:16:51,827 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:16:59,977 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:17:08,060 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:17:16,228 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:17:24,383 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:17:32,564 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:17:40,759 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:17:48,932 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:17:57,095 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:18:05,264 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:18:13,451 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:18:21,639 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:18:29,788 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:18:37,966 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:18:46,155 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:18:54,239 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:19:02,388 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:19:10,489 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:19:18,655 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:19:26,810 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:19:34,996 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:19:43,194 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:19:51,368 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:19:59,541 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:20:07,701 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:20:15,859 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:20:23,991 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:20:32,154 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:20:40,304 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:20:48,473 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:20:56,556 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:21:04,698 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:21:12,899 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:21:20,990 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:21:29,153 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:21:37,292 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:21:45,469 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:21:53,635 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:22:01,815 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:22:10,013 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:22:18,216 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:22:26,400 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:22:34,587 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:22:42,754 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:22:50,940 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:22:59,173 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:23:07,269 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:23:15,426 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:23:23,596 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:23:31,755 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:23:39,905 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:23:48,125 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:23:56,296 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:24:04,477 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:24:12,629 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:24:20,799 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:24:28,978 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:24:37,129 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:24:45,290 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:24:53,448 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:25:01,615 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:25:13,851 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:25:22,010 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:25:30,224 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:25:38,377 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:25:46,552 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:25:54,710 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:26:02,889 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:26:11,076 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:26:19,246 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:26:27,438 WARN L293 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:26:35,637 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:26:51,908 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:27:00,061 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:27:08,200 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:27:20,503 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:27:28,583 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:27:36,718 WARN L293 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:27:40,867 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 10.0)) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven 15.0))) (let ((.cse11 ((_ to_fp 8 24) roundNearestTiesToEven (/ 2338913.0 5000000.0))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven (/ 308029.0 400000.0))) (.cse13 ((_ to_fp 8 24) roundNearestTiesToEven (/ 543047.0 1250000.0))) (.cse14 ((_ to_fp 8 24) roundNearestTiesToEven (/ 15419.0 10000.0))) (.cse15 ((_ to_fp 8 24) roundNearestTiesToEven (/ 6740477.0 10000000.0))) (.cse3 (fp.neg .cse8)) (.cse5 (fp.neg .cse1))) (or (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (~X~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse7 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse9 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse10 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 ~X~0) (fp.mul roundNearestTiesToEven .cse7 .cse12)) (fp.mul roundNearestTiesToEven .cse4 .cse13)) (fp.mul roundNearestTiesToEven .cse9 .cse14)) (fp.mul roundNearestTiesToEven .cse10 .cse15))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse6 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (fp.leq .cse0 .cse1) (fp.leq ~X~0 .cse1) (fp.geq .cse2 .cse3) (= .cse0 .cse4) (fp.geq .cse0 .cse5) (= .cse0 .cse6) (= .cse0 .cse7) (fp.geq ~X~0 .cse5) (fp.leq .cse2 .cse8) (= .cse0 .cse9) (= .cse10 .cse6))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (or (exists ((v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse20 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse21 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse16 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.leq .cse16 .cse1) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse17 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse16 .cse17) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse18 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse16 .cse18) (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse19 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse16 .cse19) (exists ((~X~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 ~X~0) (fp.mul roundNearestTiesToEven .cse18 .cse12)) (fp.mul roundNearestTiesToEven .cse17 .cse13)) (fp.mul roundNearestTiesToEven .cse19 .cse14)) (fp.mul roundNearestTiesToEven .cse20 .cse15)) .cse8)) (fp.leq ~X~0 .cse1) (fp.geq ~X~0 .cse5)))))))))))) (fp.geq .cse16 .cse5) (= .cse16 .cse21)))) (= .cse20 .cse21)))) (exists ((v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse26 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse27 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse22 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.leq .cse22 .cse1) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse23 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse22 .cse23) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse24 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse22 .cse24) (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse25 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse22 .cse25) (exists ((~X~0 (_ FloatingPoint 8 24))) (and (fp.leq ~X~0 .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 ~X~0) (fp.mul roundNearestTiesToEven .cse24 .cse12)) (fp.mul roundNearestTiesToEven .cse23 .cse13)) (fp.mul roundNearestTiesToEven .cse25 .cse14)) (fp.mul roundNearestTiesToEven .cse26 .cse15)) .cse3)) (fp.geq ~X~0 .cse5)))))))))))) (fp.geq .cse22 .cse5) (= .cse22 .cse27)))) (= .cse26 .cse27))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))))) is different from false [2023-11-29 00:27:53,098 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:28:01,266 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:28:09,429 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:28:21,740 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:28:29,819 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:28:37,973 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:28:42,085 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 10.0))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 2338913.0 5000000.0))) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 308029.0 400000.0))) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (/ 543047.0 1250000.0))) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven (/ 15419.0 10000.0))) (.cse10 ((_ to_fp 8 24) roundNearestTiesToEven (/ 6740477.0 10000000.0))) (.cse11 ((_ to_fp 8 24) roundNearestTiesToEven 15.0)) (.cse12 (fp.neg .cse1))) (or (exists ((v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse13 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.leq .cse0 .cse1) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse0 .cse2) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse0 .cse3) (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse0 .cse4) (exists ((~X~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~X~0) (fp.mul roundNearestTiesToEven .cse3 .cse6)) (fp.mul roundNearestTiesToEven .cse2 .cse7)) (fp.mul roundNearestTiesToEven .cse4 .cse8)) (fp.mul roundNearestTiesToEven .cse9 .cse10)) .cse11)) (fp.leq ~X~0 .cse1) (fp.geq ~X~0 .cse12)))))))))))) (fp.geq .cse0 .cse12) (= .cse0 .cse13)))) (= .cse9 .cse13)))) (exists ((v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse18 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse19 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse14 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.leq .cse14 .cse1) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse15 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse14 .cse15) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse16 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse14 .cse16) (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse17 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse14 .cse17) (exists ((~X~0 (_ FloatingPoint 8 24))) (and (fp.leq ~X~0 .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~X~0) (fp.mul roundNearestTiesToEven .cse16 .cse6)) (fp.mul roundNearestTiesToEven .cse15 .cse7)) (fp.mul roundNearestTiesToEven .cse17 .cse8)) (fp.mul roundNearestTiesToEven .cse18 .cse10)) (fp.neg .cse11))) (fp.geq ~X~0 .cse12)))))))))))) (fp.geq .cse14 .cse12) (= .cse14 .cse19)))) (= .cse18 .cse19))))))) is different from false [2023-11-29 00:28:46,116 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 10.0))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 2338913.0 5000000.0))) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 308029.0 400000.0))) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (/ 543047.0 1250000.0))) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven (/ 15419.0 10000.0))) (.cse10 ((_ to_fp 8 24) roundNearestTiesToEven (/ 6740477.0 10000000.0))) (.cse11 ((_ to_fp 8 24) roundNearestTiesToEven 15.0)) (.cse12 (fp.neg .cse1))) (or (exists ((v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse13 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.leq .cse0 .cse1) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse0 .cse2) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse0 .cse3) (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse0 .cse4) (exists ((~X~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~X~0) (fp.mul roundNearestTiesToEven .cse3 .cse6)) (fp.mul roundNearestTiesToEven .cse2 .cse7)) (fp.mul roundNearestTiesToEven .cse4 .cse8)) (fp.mul roundNearestTiesToEven .cse9 .cse10)) .cse11)) (fp.leq ~X~0 .cse1) (fp.geq ~X~0 .cse12)))))))))))) (fp.geq .cse0 .cse12) (= .cse0 .cse13)))) (= .cse9 .cse13)))) (exists ((v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse18 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse19 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse14 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.leq .cse14 .cse1) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse15 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse14 .cse15) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse16 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse14 .cse16) (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse17 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse14 .cse17) (exists ((~X~0 (_ FloatingPoint 8 24))) (and (fp.leq ~X~0 .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~X~0) (fp.mul roundNearestTiesToEven .cse16 .cse6)) (fp.mul roundNearestTiesToEven .cse15 .cse7)) (fp.mul roundNearestTiesToEven .cse17 .cse8)) (fp.mul roundNearestTiesToEven .cse18 .cse10)) (fp.neg .cse11))) (fp.geq ~X~0 .cse12)))))))))))) (fp.geq .cse14 .cse12) (= .cse14 .cse19)))) (= .cse18 .cse19))))))) is different from true [2023-11-29 00:28:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:28:46,118 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:28:46,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:28:46,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943073115] [2023-11-29 00:28:46,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943073115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:28:46,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:28:46,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 00:28:46,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821115407] [2023-11-29 00:28:46,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:28:46,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 00:28:46,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:28:46,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 00:28:46,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=161, Unknown=3, NotChecked=54, Total=272 [2023-11-29 00:28:46,120 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 17 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 00:28:52,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:28:57,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:29:01,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:29:05,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:29:09,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:29:13,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:29:17,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:29:21,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:29:25,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:29:29,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:29:33,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:29:37,541 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (let ((.cse9 (fp.neg .cse7))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse2 (select |c_#memory_int#2| |c_~#S~0.base|)) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse6 (select |c_#memory_int#1| |c_~#E~0.base|)) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= .cse0 (let ((.cse1 (select .cse2 |c_~#S~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= (let ((.cse3 (select .cse2 (bvadd (_ bv4 32) |c_~#S~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) .cse4) (= .cse0 (let ((.cse5 (select .cse6 (bvadd |c_~#E~0.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))) (fp.leq .cse0 .cse7) (= .cse0 .cse4) (= .cse0 (let ((.cse8 (select .cse6 |c_~#E~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (fp.geq .cse0 .cse9)))) (let ((.cse11 ((_ to_fp 8 24) roundNearestTiesToEven 10.0)) (.cse18 ((_ to_fp 8 24) roundNearestTiesToEven 15.0))) (let ((.cse21 ((_ to_fp 8 24) roundNearestTiesToEven (/ 2338913.0 5000000.0))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven (/ 308029.0 400000.0))) (.cse23 ((_ to_fp 8 24) roundNearestTiesToEven (/ 543047.0 1250000.0))) (.cse24 ((_ to_fp 8 24) roundNearestTiesToEven (/ 15419.0 10000.0))) (.cse25 ((_ to_fp 8 24) roundNearestTiesToEven (/ 6740477.0 10000000.0))) (.cse13 (fp.neg .cse18)) (.cse15 (fp.neg .cse11))) (or (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (~X~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse17 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse14 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse19 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse20 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (let ((.cse12 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse21 ~X~0) (fp.mul roundNearestTiesToEven .cse17 .cse22)) (fp.mul roundNearestTiesToEven .cse14 .cse23)) (fp.mul roundNearestTiesToEven .cse19 .cse24)) (fp.mul roundNearestTiesToEven .cse20 .cse25))) (.cse10 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse16 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (fp.leq .cse10 .cse11) (fp.leq ~X~0 .cse11) (fp.geq .cse12 .cse13) (= .cse10 .cse14) (fp.geq .cse10 .cse15) (= .cse10 .cse16) (= .cse10 .cse17) (fp.geq ~X~0 .cse15) (fp.leq .cse12 .cse18) (= .cse10 .cse19) (= .cse20 .cse16))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (or (exists ((v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse30 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse31 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse26 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.leq .cse26 .cse11) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse27 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse26 .cse27) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse28 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse26 .cse28) (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse29 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse26 .cse29) (exists ((~X~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse21 ~X~0) (fp.mul roundNearestTiesToEven .cse28 .cse22)) (fp.mul roundNearestTiesToEven .cse27 .cse23)) (fp.mul roundNearestTiesToEven .cse29 .cse24)) (fp.mul roundNearestTiesToEven .cse30 .cse25)) .cse18)) (fp.leq ~X~0 .cse11) (fp.geq ~X~0 .cse15)))))))))))) (fp.geq .cse26 .cse15) (= .cse26 .cse31)))) (= .cse30 .cse31)))) (exists ((v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse36 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse37 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse32 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (fp.leq .cse32 .cse11) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse33 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse32 .cse33) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse34 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse32 .cse34) (exists ((v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse35 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)))) (and (= .cse32 .cse35) (exists ((~X~0 (_ FloatingPoint 8 24))) (and (fp.leq ~X~0 .cse11) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse21 ~X~0) (fp.mul roundNearestTiesToEven .cse34 .cse22)) (fp.mul roundNearestTiesToEven .cse33 .cse23)) (fp.mul roundNearestTiesToEven .cse35 .cse24)) (fp.mul roundNearestTiesToEven .cse36 .cse25)) .cse13)) (fp.geq ~X~0 .cse15)))))))))))) (fp.geq .cse32 .cse15) (= .cse32 .cse37)))) (= .cse36 .cse37))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))))) (fp.geq c_~X~0 .cse9) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~X~0 .cse7)))) is different from false [2023-11-29 00:29:41,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:29:45,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:29:49,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:29:53,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:29:57,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:30:01,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:30:05,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:30:09,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:30:13,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:30:17,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:30:21,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:30:26,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:30:30,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:30:30,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:30:30,011 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2023-11-29 00:30:30,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 00:30:30,071 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2023-11-29 00:30:30,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:30:30,072 INFO L225 Difference]: With dead ends: 36 [2023-11-29 00:30:30,072 INFO L226 Difference]: Without dead ends: 34 [2023-11-29 00:30:30,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=126, Invalid=344, Unknown=4, NotChecked=126, Total=600 [2023-11-29 00:30:30,074 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 12 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 97.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 97.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:30:30,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 78 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 114 Invalid, 23 Unknown, 86 Unchecked, 97.8s Time] [2023-11-29 00:30:30,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-29 00:30:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-29 00:30:30,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-29 00:30:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2023-11-29 00:30:30,085 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 26 [2023-11-29 00:30:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:30:30,086 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2023-11-29 00:30:30,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 00:30:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2023-11-29 00:30:30,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-29 00:30:30,087 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:30:30,088 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:30:30,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:30:30,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:30:30,288 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:30:30,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:30:30,289 INFO L85 PathProgramCache]: Analyzing trace with hash 650950870, now seen corresponding path program 1 times [2023-11-29 00:30:30,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:30:30,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329903526] [2023-11-29 00:30:30,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:30:30,290 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 [2023-11-29 00:30:30,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:30:30,290 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:30:30,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08de604c-2a34-4b09-839b-2d81b8b238dc/bin/uautomizer-verify-BQ2R08f2Ya/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