./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/inv_Newton-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/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_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/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_f265d76d-8d52-4679-ade8-2e140445cfe4/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 67155ca1e686450fca2a6f4b9f638c838555b88a3546adff9656d040c859ca12 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:21:20,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:21:20,802 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:21:20,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:21:20,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:21:20,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:21:20,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:21:20,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:21:20,834 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:21:20,835 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:21:20,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:21:20,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:21:20,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:21:20,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:21:20,837 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:21:20,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:21:20,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:21:20,839 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:21:20,840 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:21:20,840 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:21:20,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:21:20,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:21:20,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:21:20,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:21:20,843 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:21:20,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:21:20,844 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:21:20,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:21:20,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:21:20,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:21:20,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:21:20,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:21:20,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:21:20,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:21:20,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:21:20,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:21:20,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:21:20,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:21:20,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:21:20,847 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:21:20,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:21:20,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:21:20,848 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_f265d76d-8d52-4679-ade8-2e140445cfe4/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_f265d76d-8d52-4679-ade8-2e140445cfe4/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 -> 67155ca1e686450fca2a6f4b9f638c838555b88a3546adff9656d040c859ca12 [2023-11-29 04:21:21,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:21:21,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:21:21,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:21:21,084 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:21:21,084 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:21:21,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/inv_Newton-2.c [2023-11-29 04:21:23,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:21:23,983 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:21:23,984 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/sv-benchmarks/c/float-benchs/inv_Newton-2.c [2023-11-29 04:21:23,989 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/data/a7a76bd1c/f9a6d3233b3e4af784ade2955ff04082/FLAG210186c58 [2023-11-29 04:21:24,001 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/data/a7a76bd1c/f9a6d3233b3e4af784ade2955ff04082 [2023-11-29 04:21:24,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:21:24,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:21:24,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:21:24,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:21:24,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:21:24,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:21:24" (1/1) ... [2023-11-29 04:21:24,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc63813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:24, skipping insertion in model container [2023-11-29 04:21:24,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:21:24" (1/1) ... [2023-11-29 04:21:24,029 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:21:24,156 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_f265d76d-8d52-4679-ade8-2e140445cfe4/sv-benchmarks/c/float-benchs/inv_Newton-2.c[847,860] [2023-11-29 04:21:24,175 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:21:24,185 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:21:24,198 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_f265d76d-8d52-4679-ade8-2e140445cfe4/sv-benchmarks/c/float-benchs/inv_Newton-2.c[847,860] [2023-11-29 04:21:24,207 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:21:24,224 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:21:24,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:24 WrapperNode [2023-11-29 04:21:24,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:21:24,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:21:24,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:21:24,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:21:24,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:24" (1/1) ... [2023-11-29 04:21:24,242 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:24" (1/1) ... [2023-11-29 04:21:24,263 INFO L138 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 76 [2023-11-29 04:21:24,263 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:21:24,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:21:24,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:21:24,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:21:24,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:24" (1/1) ... [2023-11-29 04:21:24,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:24" (1/1) ... [2023-11-29 04:21:24,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:24" (1/1) ... [2023-11-29 04:21:24,292 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2023-11-29 04:21:24,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:24" (1/1) ... [2023-11-29 04:21:24,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:24" (1/1) ... [2023-11-29 04:21:24,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:24" (1/1) ... [2023-11-29 04:21:24,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:24" (1/1) ... [2023-11-29 04:21:24,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:24" (1/1) ... [2023-11-29 04:21:24,307 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:24" (1/1) ... [2023-11-29 04:21:24,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:21:24,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:21:24,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:21:24,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:21:24,312 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:24" (1/1) ... [2023-11-29 04:21:24,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:21:24,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:21:24,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:21:24,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:21:24,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:21:24,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:21:24,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:21:24,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 04:21:24,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:21:24,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-29 04:21:24,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-29 04:21:24,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-11-29 04:21:24,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 04:21:24,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 04:21:24,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 04:21:24,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-29 04:21:24,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-29 04:21:24,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-11-29 04:21:24,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:21:24,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:21:24,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 04:21:24,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 04:21:24,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 04:21:24,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:21:24,461 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:21:24,463 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:21:24,580 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:21:24,604 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:21:24,604 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:21:24,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:21:24 BoogieIcfgContainer [2023-11-29 04:21:24,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:21:24,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:21:24,608 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:21:24,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:21:24,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:21:24" (1/3) ... [2023-11-29 04:21:24,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de1f314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:21:24, skipping insertion in model container [2023-11-29 04:21:24,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:24" (2/3) ... [2023-11-29 04:21:24,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de1f314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:21:24, skipping insertion in model container [2023-11-29 04:21:24,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:21:24" (3/3) ... [2023-11-29 04:21:24,614 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton-2.c [2023-11-29 04:21:24,629 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:21:24,630 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:21:24,669 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:21:24,675 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;@6f63a87e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:21:24,675 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:21:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:24,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 04:21:24,685 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:24,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:24,685 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:24,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:24,690 INFO L85 PathProgramCache]: Analyzing trace with hash 190800760, now seen corresponding path program 1 times [2023-11-29 04:21:24,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:24,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879576236] [2023-11-29 04:21:24,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:24,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:21:24,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:24,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879576236] [2023-11-29 04:21:24,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879576236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:24,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:24,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:21:24,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304527769] [2023-11-29 04:21:24,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:24,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:21:24,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:24,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:21:24,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:21:24,915 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:24,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:24,937 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2023-11-29 04:21:24,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:21:24,940 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 04:21:24,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:24,948 INFO L225 Difference]: With dead ends: 24 [2023-11-29 04:21:24,948 INFO L226 Difference]: Without dead ends: 11 [2023-11-29 04:21:24,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 04:21:24,955 INFO L413 NwaCegarLoop]: 12 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, 12 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 04:21:24,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:21:24,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-11-29 04:21:24,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-11-29 04:21:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-11-29 04:21:24,985 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2023-11-29 04:21:24,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:24,986 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-11-29 04:21:24,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-11-29 04:21:24,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 04:21:24,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:24,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:24,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:21:24,988 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:24,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:24,989 INFO L85 PathProgramCache]: Analyzing trace with hash -618665030, now seen corresponding path program 1 times [2023-11-29 04:21:24,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:24,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161386231] [2023-11-29 04:21:24,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:24,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:25,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:21:25,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:21:25,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161386231] [2023-11-29 04:21:25,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161386231] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:25,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:25,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:21:25,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167459878] [2023-11-29 04:21:25,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:25,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:21:25,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:21:25,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:21:25,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:21:25,122 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:25,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:25,138 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2023-11-29 04:21:25,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:21:25,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 04:21:25,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:25,140 INFO L225 Difference]: With dead ends: 16 [2023-11-29 04:21:25,140 INFO L226 Difference]: Without dead ends: 12 [2023-11-29 04:21:25,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:21:25,142 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:25,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:21:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-29 04:21:25,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-29 04:21:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:25,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-11-29 04:21:25,147 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2023-11-29 04:21:25,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:25,148 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-11-29 04:21:25,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-11-29 04:21:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 04:21:25,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:25,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:25,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:21:25,150 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:25,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:25,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1997659876, now seen corresponding path program 1 times [2023-11-29 04:21:25,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:21:25,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586099173] [2023-11-29 04:21:25,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:25,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:21:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:21:25,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:21:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:21:25,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:21:25,239 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:21:25,240 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:21:25,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:21:25,245 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-29 04:21:25,248 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:21:25,262 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated [2023-11-29 04:21:25,263 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 04:21:25,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:21:25 BoogieIcfgContainer [2023-11-29 04:21:25,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:21:25,275 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:21:25,275 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:21:25,275 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:21:25,276 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:21:24" (3/4) ... [2023-11-29 04:21:25,278 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:21:25,279 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:21:25,280 INFO L158 Benchmark]: Toolchain (without parser) took 1274.47ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 96.1MB in the beginning and 128.1MB in the end (delta: -32.0MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2023-11-29 04:21:25,280 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 142.6MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:21:25,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.07ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 85.1MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 04:21:25,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.33ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 83.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:21:25,282 INFO L158 Benchmark]: Boogie Preprocessor took 45.87ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 80.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:21:25,282 INFO L158 Benchmark]: RCFGBuilder took 294.16ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 68.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 04:21:25,283 INFO L158 Benchmark]: TraceAbstraction took 666.15ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 67.8MB in the beginning and 129.2MB in the end (delta: -61.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:21:25,283 INFO L158 Benchmark]: Witness Printer took 4.11ms. Allocated memory is still 182.5MB. Free memory was 129.2MB in the beginning and 128.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:21:25,286 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.18ms. Allocated memory is still 142.6MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.07ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 85.1MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.33ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 83.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.87ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 80.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 294.16ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 68.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 666.15ms. Allocated memory was 142.6MB in the beginning and 182.5MB in the end (delta: 39.8MB). Free memory was 67.8MB in the beginning and 129.2MB in the end (delta: -61.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.11ms. Allocated memory is still 182.5MB. Free memory was 129.2MB in the beginning and 128.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 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: 23]: 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 someBinaryDOUBLEComparisonOperation at line 60, overapproximation of to_real at line 38, overapproximation of someBinaryArithmeticDOUBLEoperation at line 43. Possible FailurePath: [L53] double a,r; [L55] a = __VERIFIER_nondet_double() [L56] CALL assume_abort_if_not(a >= 20. && a <= 30.) [L21] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L56] RET assume_abort_if_not(a >= 20. && a <= 30.) [L58] CALL, EXPR inv(a) [L33] double xi, xsi, temp; [L34] signed int cond, exp; [L35] union double_int A_u, xi_u; [L36] A_u.d = A [L37] EXPR A_u.i [L37] EXPR A_u.i & 0x7FF00000 VAL [A=2145386510, A_u={5:0}, \old(A)=2145386510, xi_u={4:0}] [L37] exp = (signed int) ((A_u.i & 0x7FF00000) >> 20) - 1023 [L38] xi_u.d = 1 [L39] xi_u.i = ((1023-exp) << 20) [L40] EXPR xi_u.d [L40] xi = xi_u.d [L41] cond = 1 VAL [A=2145386510, A_u={5:0}, \old(A)=2145386510, cond=1, exp=-1023, xi=2145386512, xi_u={4:0}] [L42] COND TRUE \read(cond) [L43] xsi = 2*xi-A*xi*xi [L44] temp = xsi-xi [L45] cond = ((temp > 1e-10) || (temp < -1e-10)) [L46] xi = xsi VAL [A=2145386510, A_u={5:0}, \old(A)=2145386510, cond=0, exp=-1023, xi=2145386511, xi_u={4:0}, xsi=2145386511] [L42] COND FALSE !(\read(cond)) VAL [A=2145386510, A_u={5:0}, \old(A)=2145386510, cond=0, exp=-1023, xi=2145386511, xi_u={4:0}, xsi=2145386511] [L48] return xi; [L48] return xi; [L48] return xi; [L58] RET, EXPR inv(a) [L58] r = inv(a) [L60] CALL __VERIFIER_assert(r >= 0 && r <= 0.06) [L23] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L23] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 22 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 04:21:25,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/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_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/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_f265d76d-8d52-4679-ade8-2e140445cfe4/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 67155ca1e686450fca2a6f4b9f638c838555b88a3546adff9656d040c859ca12 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:21:27,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:21:27,343 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 04:21:27,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:21:27,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:21:27,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:21:27,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:21:27,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:21:27,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:21:27,393 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:21:27,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:21:27,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:21:27,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:21:27,396 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:21:27,396 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:21:27,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:21:27,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:21:27,398 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:21:27,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:21:27,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:21:27,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:21:27,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:21:27,401 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:21:27,401 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:21:27,402 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:21:27,402 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:21:27,403 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:21:27,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:21:27,404 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:21:27,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:21:27,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:21:27,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:21:27,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:21:27,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:21:27,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:21:27,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:21:27,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:21:27,406 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:21:27,407 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:21:27,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:21:27,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:21:27,407 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:21:27,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:21:27,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:21:27,408 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:21:27,408 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_f265d76d-8d52-4679-ade8-2e140445cfe4/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_f265d76d-8d52-4679-ade8-2e140445cfe4/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 -> 67155ca1e686450fca2a6f4b9f638c838555b88a3546adff9656d040c859ca12 [2023-11-29 04:21:27,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:21:27,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:21:27,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:21:27,706 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:21:27,706 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:21:27,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/inv_Newton-2.c [2023-11-29 04:21:30,439 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:21:30,629 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:21:30,629 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/sv-benchmarks/c/float-benchs/inv_Newton-2.c [2023-11-29 04:21:30,636 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/data/1db034154/b21cf20e9e1a4519b54f2310e0d0acff/FLAGc09b02a9b [2023-11-29 04:21:30,649 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/data/1db034154/b21cf20e9e1a4519b54f2310e0d0acff [2023-11-29 04:21:30,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:21:30,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:21:30,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:21:30,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:21:30,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:21:30,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:21:30" (1/1) ... [2023-11-29 04:21:30,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e1342ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:30, skipping insertion in model container [2023-11-29 04:21:30,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:21:30" (1/1) ... [2023-11-29 04:21:30,678 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:21:30,798 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_f265d76d-8d52-4679-ade8-2e140445cfe4/sv-benchmarks/c/float-benchs/inv_Newton-2.c[847,860] [2023-11-29 04:21:30,816 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:21:30,828 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:21:30,838 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_f265d76d-8d52-4679-ade8-2e140445cfe4/sv-benchmarks/c/float-benchs/inv_Newton-2.c[847,860] [2023-11-29 04:21:30,847 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:21:30,865 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:21:30,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:30 WrapperNode [2023-11-29 04:21:30,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:21:30,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:21:30,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:21:30,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:21:30,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:30" (1/1) ... [2023-11-29 04:21:30,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:30" (1/1) ... [2023-11-29 04:21:30,901 INFO L138 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2023-11-29 04:21:30,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:21:30,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:21:30,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:21:30,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:21:30,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:30" (1/1) ... [2023-11-29 04:21:30,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:30" (1/1) ... [2023-11-29 04:21:30,916 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:30" (1/1) ... [2023-11-29 04:21:30,929 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2023-11-29 04:21:30,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:30" (1/1) ... [2023-11-29 04:21:30,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:30" (1/1) ... [2023-11-29 04:21:30,939 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:30" (1/1) ... [2023-11-29 04:21:30,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:30" (1/1) ... [2023-11-29 04:21:30,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:30" (1/1) ... [2023-11-29 04:21:30,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:30" (1/1) ... [2023-11-29 04:21:30,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:21:30,951 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:21:30,951 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:21:30,951 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:21:30,952 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:30" (1/1) ... [2023-11-29 04:21:30,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:21:30,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:21:30,979 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:21:30,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:21:31,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:21:31,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-11-29 04:21:31,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-11-29 04:21:31,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2023-11-29 04:21:31,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-11-29 04:21:31,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-11-29 04:21:31,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2023-11-29 04:21:31,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:21:31,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 04:21:31,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 04:21:31,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:21:31,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 04:21:31,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 04:21:31,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 04:21:31,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:21:31,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:21:31,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:21:31,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 04:21:31,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 04:21:31,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 04:21:31,113 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:21:31,115 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:21:35,418 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:21:35,453 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:21:35,453 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:21:35,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:21:35 BoogieIcfgContainer [2023-11-29 04:21:35,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:21:35,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:21:35,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:21:35,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:21:35,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:21:30" (1/3) ... [2023-11-29 04:21:35,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ea113f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:21:35, skipping insertion in model container [2023-11-29 04:21:35,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:21:30" (2/3) ... [2023-11-29 04:21:35,463 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ea113f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:21:35, skipping insertion in model container [2023-11-29 04:21:35,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:21:35" (3/3) ... [2023-11-29 04:21:35,465 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton-2.c [2023-11-29 04:21:35,482 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:21:35,483 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:21:35,526 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:21:35,533 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;@b296022, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:21:35,533 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:21:35,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:35,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 04:21:35,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:35,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:35,543 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:35,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:35,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1259772761, now seen corresponding path program 1 times [2023-11-29 04:21:35,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:21:35,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018067805] [2023-11-29 04:21:35,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:35,562 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 04:21:35,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:21:35,563 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/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 04:21:35,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/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 04:21:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:35,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 04:21:35,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:21:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:21:35,714 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:21:35,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:21:35,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018067805] [2023-11-29 04:21:35,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018067805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:35,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:35,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:21:35,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327963827] [2023-11-29 04:21:35,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:35,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:21:35,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:21:35,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:21:35,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:21:35,759 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:35,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:35,819 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2023-11-29 04:21:35,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:21:35,822 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 04:21:35,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:35,831 INFO L225 Difference]: With dead ends: 18 [2023-11-29 04:21:35,831 INFO L226 Difference]: Without dead ends: 8 [2023-11-29 04:21:35,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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 04:21:35,838 INFO L413 NwaCegarLoop]: 7 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, 7 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 04:21:35,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:21:35,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-11-29 04:21:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-11-29 04:21:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-11-29 04:21:35,870 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2023-11-29 04:21:35,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:35,871 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-11-29 04:21:35,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-11-29 04:21:35,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 04:21:35,872 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:35,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:35,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/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 04:21:36,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/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 04:21:36,073 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:36,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:36,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1202514459, now seen corresponding path program 1 times [2023-11-29 04:21:36,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:21:36,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9476792] [2023-11-29 04:21:36,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:36,076 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 04:21:36,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:21:36,077 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/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 04:21:36,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/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 04:21:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:36,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:21:36,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:21:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:21:36,217 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:21:36,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:21:36,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9476792] [2023-11-29 04:21:36,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9476792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:21:36,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:21:36,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:21:36,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331001108] [2023-11-29 04:21:36,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:21:36,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:21:36,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:21:36,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:21:36,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:21:36,222 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:40,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:21:44,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:21:48,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:21:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:21:48,996 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2023-11-29 04:21:48,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:21:48,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 04:21:48,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:21:48,998 INFO L225 Difference]: With dead ends: 13 [2023-11-29 04:21:48,998 INFO L226 Difference]: Without dead ends: 9 [2023-11-29 04:21:48,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 04:21:49,000 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:21:49,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 3 Unknown, 0 Unchecked, 12.8s Time] [2023-11-29 04:21:49,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-11-29 04:21:49,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-11-29 04:21:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:49,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2023-11-29 04:21:49,006 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2023-11-29 04:21:49,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:21:49,006 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2023-11-29 04:21:49,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2023-11-29 04:21:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 04:21:49,008 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:21:49,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:21:49,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/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 04:21:49,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/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 04:21:49,210 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:21:49,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:21:49,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1377844293, now seen corresponding path program 1 times [2023-11-29 04:21:49,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:21:49,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177048256] [2023-11-29 04:21:49,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:21:49,212 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 04:21:49,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:21:49,214 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/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 04:21:49,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/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 04:21:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:21:50,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 04:21:50,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:21:59,091 WARN L293 SmtUtils]: Spent 8.34s 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 04:22:07,290 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:22:15,654 WARN L293 SmtUtils]: Spent 8.36s 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 04:22:23,855 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:22:32,250 WARN L293 SmtUtils]: Spent 8.37s 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 04:22:40,623 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:22:49,078 WARN L293 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:23:05,783 WARN L293 SmtUtils]: Spent 8.38s 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 04:23:14,033 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:23:26,945 WARN L293 SmtUtils]: Spent 8.76s 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 04:23:35,179 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:23:47,838 WARN L293 SmtUtils]: Spent 8.50s 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 04:23:56,330 WARN L293 SmtUtils]: Spent 8.49s 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 04:24:04,824 WARN L293 SmtUtils]: Spent 8.49s 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 04:24:13,332 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:24:21,844 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:24:26,185 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse6 (fp.neg .cse5)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (or (and (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv0 32)) (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse4 (let ((.cse8 (let ((.cse9 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse8) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse8)) .cse8)))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) .cse0) (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse3) (not (fp.gt .cse4 .cse5)) (not (fp.lt .cse4 .cse6))))))) (and (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse10 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse10 .cse2) (fp.leq .cse10 .cse3) (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) .cse0) (fp.lt (let ((.cse11 (let ((.cse12 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse11) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse11) .cse11)) .cse11)) .cse6)))))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse13 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse13 .cse2) (fp.leq .cse13 .cse3) (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) .cse0) (fp.gt (let ((.cse14 (let ((.cse15 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse15) ((_ extract 62 52) .cse15) ((_ extract 51 0) .cse15))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse14) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse14) .cse14)) .cse14)) .cse5))))))) (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv1 32)))))) is different from false [2023-11-29 04:24:38,821 WARN L293 SmtUtils]: Spent 8.51s 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 04:24:47,260 WARN L293 SmtUtils]: Spent 8.44s 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 04:24:55,759 WARN L293 SmtUtils]: Spent 8.50s 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 04:25:04,265 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:25:12,779 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:25:16,903 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse3) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse3) .cse3)) .cse3))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (not (fp.gt .cse1 .cse2)) (not (fp.lt .cse1 (fp.neg .cse2))))))) is different from false [2023-11-29 04:25:20,978 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse3) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse3) .cse3)) .cse3))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (not (fp.gt .cse1 .cse2)) (not (fp.lt .cse1 (fp.neg .cse2))))))) is different from true [2023-11-29 04:25:33,611 WARN L293 SmtUtils]: Spent 8.51s 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 04:25:42,022 WARN L293 SmtUtils]: Spent 8.41s 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 04:25:50,521 WARN L293 SmtUtils]: Spent 8.50s 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 04:25:59,116 WARN L293 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:26:07,670 WARN L293 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:26:20,301 WARN L293 SmtUtils]: Spent 8.52s 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 04:26:28,749 WARN L293 SmtUtils]: Spent 8.45s 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 04:26:37,314 WARN L293 SmtUtils]: Spent 8.56s 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 04:26:45,935 WARN L293 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:26:54,504 WARN L293 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:26:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 04:26:54,505 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:27:03,209 WARN L293 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:27:11,808 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:27:15,973 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)) |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1))) is different from false [2023-11-29 04:27:20,141 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)) |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1))) is different from true [2023-11-29 04:27:28,754 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:27:37,426 WARN L293 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:27:45,977 WARN L293 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:27:54,644 WARN L293 SmtUtils]: Spent 8.67s 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 04:28:00,411 WARN L876 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) .cse3))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse2)) (fp.gt .cse0 .cse1) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))))) is different from true [2023-11-29 04:28:09,114 WARN L293 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:28:18,277 WARN L293 SmtUtils]: Spent 9.16s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:28:26,847 WARN L293 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:28:36,548 WARN L293 SmtUtils]: Spent 9.70s 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 04:28:40,713 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) .cse3))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse2)) (fp.gt .cse0 .cse1) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))))))))) is different from true [2023-11-29 04:28:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 04:28:40,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:28:40,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177048256] [2023-11-29 04:28:40,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177048256] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:28:40,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:28:40,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2023-11-29 04:28:40,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950962202] [2023-11-29 04:28:40,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:28:40,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:28:40,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:28:40,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:28:40,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=24, Unknown=7, NotChecked=60, Total=110 [2023-11-29 04:28:40,719 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:28:45,000 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (or .cse0 (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse1 (let ((.cse4 (let ((.cse5 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse4)) .cse4))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse1 (fp.neg .cse2)) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse3)) (fp.gt .cse1 .cse2) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))))))))) (let ((.cse7 (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (.cse6 (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)))) (or (and .cse6 .cse7 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (or (not .cse7) (not .cse6)) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-29 04:28:51,022 WARN L876 $PredicateComparison]: unable to prove that (and (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) .cse3))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse2)) (fp.gt .cse0 .cse1) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))))))))) is different from true [2023-11-29 04:28:55,175 WARN L854 $PredicateComparison]: unable to prove that (and (fp.leq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)) |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1))) (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) |c_ULTIMATE.start_inv_~A#1|) (= |c_ULTIMATE.start_inv_~xi~0#1| (let ((.cse2 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))))) (fp.geq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 04:28:59,349 WARN L876 $PredicateComparison]: unable to prove that (and (fp.leq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)) |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1))) (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) |c_ULTIMATE.start_inv_~A#1|) (= |c_ULTIMATE.start_inv_~xi~0#1| (let ((.cse2 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))))) (fp.geq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-29 04:29:03,598 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv0 32)))) (and (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse7 (fp.neg .cse6)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (or (and .cse0 (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse5 (let ((.cse9 (let ((.cse10 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 .cse9) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse9) .cse9)) .cse9)))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) .cse1) (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse4) (not (fp.gt .cse5 .cse6)) (not (fp.lt .cse5 .cse7))))))) (and (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse11 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse11 .cse3) (fp.leq .cse11 .cse4) (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) .cse1) (fp.lt (let ((.cse12 (let ((.cse13 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 .cse12) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 .cse12) .cse12)) .cse12)) .cse7)))))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse14 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse14 .cse3) (fp.leq .cse14 .cse4) (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) .cse1) (fp.gt (let ((.cse15 (let ((.cse16 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse16) ((_ extract 62 52) .cse16) ((_ extract 51 0) .cse16))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 .cse15) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse14 .cse15) .cse15)) .cse15)) .cse6))))))) (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv1 32)))))) (not .cse0))) is different from false [2023-11-29 04:29:08,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:29:12,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:29:16,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:29:20,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:29:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:29:20,441 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2023-11-29 04:29:20,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:29:20,443 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 04:29:20,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:29:20,443 INFO L225 Difference]: With dead ends: 14 [2023-11-29 04:29:20,444 INFO L226 Difference]: Without dead ends: 10 [2023-11-29 04:29:20,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 54.0s TimeCoverageRelationStatistics Valid=27, Invalid=27, Unknown=12, NotChecked=144, Total=210 [2023-11-29 04:29:20,446 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:29:20,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 4 Unknown, 61 Unchecked, 16.9s Time] [2023-11-29 04:29:20,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-29 04:29:20,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-29 04:29:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:29:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2023-11-29 04:29:20,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2023-11-29 04:29:20,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:29:20,453 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2023-11-29 04:29:20,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:29:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2023-11-29 04:29:20,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 04:29:20,454 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:29:20,455 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:29:20,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/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)] Forceful destruction successful, exit code 0 [2023-11-29 04:29:20,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/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 04:29:20,656 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:29:20,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:29:20,656 INFO L85 PathProgramCache]: Analyzing trace with hash -235413019, now seen corresponding path program 2 times [2023-11-29 04:29:20,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:29:20,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144866248] [2023-11-29 04:29:20,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:29:20,657 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 04:29:20,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:29:20,658 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/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 04:29:20,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f265d76d-8d52-4679-ade8-2e140445cfe4/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 [2023-11-29 04:29:24,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:29:24,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:29:25,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 04:29:25,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:29:35,119 WARN L293 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:29:43,667 WARN L293 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:29:52,184 WARN L293 SmtUtils]: Spent 8.52s 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 04:29:56,386 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (and (= (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| .cse0) .cse0))) |c_ULTIMATE.start_inv_~xi~0#1|) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)) |c_ULTIMATE.start_inv_~A#1|))) (fp.leq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (fp.geq |c_ULTIMATE.start_inv_~A#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 04:30:05,751 WARN L293 SmtUtils]: Spent 9.27s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:30:14,708 WARN L293 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:30:24,118 WARN L293 SmtUtils]: Spent 9.40s 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 04:30:33,110 WARN L293 SmtUtils]: Spent 8.99s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:30:42,256 WARN L293 SmtUtils]: Spent 9.14s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:30:51,513 WARN L293 SmtUtils]: Spent 9.26s 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 04:31:00,381 WARN L293 SmtUtils]: Spent 8.86s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:31:09,727 WARN L293 SmtUtils]: Spent 9.34s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:31:19,193 WARN L293 SmtUtils]: Spent 9.47s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:31:28,555 WARN L293 SmtUtils]: Spent 9.36s 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 04:31:37,506 WARN L293 SmtUtils]: Spent 8.84s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:31:46,607 WARN L293 SmtUtils]: Spent 9.10s 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 04:31:56,057 WARN L293 SmtUtils]: Spent 9.45s 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 04:32:05,339 WARN L293 SmtUtils]: Spent 9.28s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:32:14,759 WARN L293 SmtUtils]: Spent 9.42s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:32:24,064 WARN L293 SmtUtils]: Spent 9.30s 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 04:32:33,389 WARN L293 SmtUtils]: Spent 9.27s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:32:42,339 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:32:51,617 WARN L293 SmtUtils]: Spent 9.28s 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 04:33:00,705 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:33:09,789 WARN L293 SmtUtils]: Spent 9.08s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:33:19,002 WARN L293 SmtUtils]: Spent 9.21s 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 04:33:23,524 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (.cse11 (fp.neg .cse4)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (or (and (or (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2) (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64))) (let ((.cse3 (let ((.cse7 (let ((.cse8 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse7) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse7) .cse7))))) (and (fp.gt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse3) .cse4) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse3)) |c_ULTIMATE.start_inv_~xi~0#1|) (= .cse6 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8))))))))) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse9 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (and (fp.leq .cse9 .cse1) (fp.geq .cse9 .cse2) (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64))) (let ((.cse10 (let ((.cse12 (let ((.cse13 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse12) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse9 .cse12) .cse12))))) (and (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse10) .cse11) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse10) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse9 .cse10) .cse10)) |c_ULTIMATE.start_inv_~xi~0#1|) (= .cse6 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8)))))))))) (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv1 32))) (and (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv0 32)) (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse14 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (let ((.cse15 (let ((.cse17 (let ((.cse18 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse18) ((_ extract 62 52) .cse18) ((_ extract 51 0) .cse18))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse17) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse14 .cse17) .cse17))))) (let ((.cse16 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse15))) (and (fp.leq .cse14 .cse1) (fp.geq .cse14 .cse2) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse15) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse14 .cse15) .cse15)) |c_ULTIMATE.start_inv_~xi~0#1|) (= .cse6 (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8))) (not (fp.lt .cse16 .cse11)) (not (fp.gt .cse16 .cse4))))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 04:33:32,506 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:33:42,123 WARN L293 SmtUtils]: Spent 9.62s 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 04:33:51,286 WARN L293 SmtUtils]: Spent 9.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 04:34:00,548 WARN L293 SmtUtils]: Spent 9.26s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:34:09,902 WARN L293 SmtUtils]: Spent 9.35s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:34:19,112 WARN L293 SmtUtils]: Spent 9.21s 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 04:34:23,465 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_skolemized_v_prenex_1_8 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)))) (let ((.cse2 (let ((.cse5 (let ((.cse6 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_8) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse5) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse5) .cse5))))) (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse2)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse2) .cse2)) |c_ULTIMATE.start_inv_~xi~0#1|) (= ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp ((_ extract 63 63) v_skolemized_v_prenex_1_8) ((_ extract 62 52) v_skolemized_v_prenex_1_8) ((_ extract 51 0) v_skolemized_v_prenex_1_8))) (not (fp.lt .cse3 (fp.neg .cse4))) (not (fp.gt .cse3 .cse4))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 04:34:32,958 WARN L293 SmtUtils]: Spent 9.39s 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 04:34:42,431 WARN L293 SmtUtils]: Spent 9.47s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:34:51,729 WARN L293 SmtUtils]: Spent 9.30s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:35:01,001 WARN L293 SmtUtils]: Spent 9.27s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:35:10,293 WARN L293 SmtUtils]: Spent 9.29s 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 04:35:19,584 WARN L293 SmtUtils]: Spent 9.29s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:35:28,881 WARN L293 SmtUtils]: Spent 9.30s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:35:38,420 WARN L293 SmtUtils]: Spent 9.54s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:35:47,708 WARN L293 SmtUtils]: Spent 9.28s 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 04:35:57,027 WARN L293 SmtUtils]: Spent 9.32s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:36:06,179 WARN L293 SmtUtils]: Spent 9.15s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:36:15,524 WARN L293 SmtUtils]: Spent 9.34s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:36:24,893 WARN L293 SmtUtils]: Spent 9.37s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:36:38,621 WARN L293 SmtUtils]: Spent 9.33s 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)