./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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_402ec212-680f-4d0b-bb52-496d0f781bb4/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 f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:08:28,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:08:28,831 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:08:28,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:08:28,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:08:28,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:08:28,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:08:28,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:08:28,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:08:28,863 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:08:28,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:08:28,864 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:08:28,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:08:28,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:08:28,865 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:08:28,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:08:28,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:08:28,867 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:08:28,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:08:28,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:08:28,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:08:28,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:08:28,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:08:28,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:08:28,871 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:08:28,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:08:28,871 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:08:28,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:08:28,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:08:28,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:08:28,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:08:28,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:08:28,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:08:28,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:08:28,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:08:28,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:08:28,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:08:28,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:08:28,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:08:28,875 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:08:28,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:08:28,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:08:28,875 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_402ec212-680f-4d0b-bb52-496d0f781bb4/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_402ec212-680f-4d0b-bb52-496d0f781bb4/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 -> f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 [2023-11-29 01:08:29,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:08:29,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:08:29,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:08:29,107 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:08:29,107 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:08:29,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2023-11-29 01:08:31,871 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:08:32,045 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:08:32,046 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2023-11-29 01:08:32,054 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/data/812e06ff5/eefb8ec5cc294540865489a3a615d916/FLAGa3cf07ede [2023-11-29 01:08:32,069 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/data/812e06ff5/eefb8ec5cc294540865489a3a615d916 [2023-11-29 01:08:32,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:08:32,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:08:32,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:08:32,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:08:32,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:08:32,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:08:32" (1/1) ... [2023-11-29 01:08:32,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a2aab04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:32, skipping insertion in model container [2023-11-29 01:08:32,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:08:32" (1/1) ... [2023-11-29 01:08:32,107 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:08:32,274 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_402ec212-680f-4d0b-bb52-496d0f781bb4/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2023-11-29 01:08:32,281 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:08:32,291 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:08:32,314 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_402ec212-680f-4d0b-bb52-496d0f781bb4/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2023-11-29 01:08:32,317 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:08:32,332 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:08:32,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:32 WrapperNode [2023-11-29 01:08:32,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:08:32,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:08:32,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:08:32,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:08:32,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:32" (1/1) ... [2023-11-29 01:08:32,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:32" (1/1) ... [2023-11-29 01:08:32,370 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 112 [2023-11-29 01:08:32,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:08:32,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:08:32,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:08:32,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:08:32,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:32" (1/1) ... [2023-11-29 01:08:32,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:32" (1/1) ... [2023-11-29 01:08:32,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:32" (1/1) ... [2023-11-29 01:08:32,400 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 01:08:32,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:32" (1/1) ... [2023-11-29 01:08:32,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:32" (1/1) ... [2023-11-29 01:08:32,408 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:32" (1/1) ... [2023-11-29 01:08:32,410 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:32" (1/1) ... [2023-11-29 01:08:32,412 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:32" (1/1) ... [2023-11-29 01:08:32,413 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:32" (1/1) ... [2023-11-29 01:08:32,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:08:32,417 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:08:32,418 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:08:32,418 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:08:32,419 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:32" (1/1) ... [2023-11-29 01:08:32,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:08:32,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:08:32,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:08:32,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:08:32,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:08:32,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:08:32,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:08:32,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 01:08:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:08:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-29 01:08:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-29 01:08:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-11-29 01:08:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 01:08:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 01:08:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 01:08:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-29 01:08:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-29 01:08:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-11-29 01:08:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:08:32,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:08:32,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 01:08:32,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 01:08:32,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 01:08:32,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:08:32,575 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:08:32,577 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:08:32,723 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:08:32,743 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:08:32,743 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 01:08:32,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:08:32 BoogieIcfgContainer [2023-11-29 01:08:32,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:08:32,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:08:32,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:08:32,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:08:32,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:08:32" (1/3) ... [2023-11-29 01:08:32,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8a0c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:08:32, skipping insertion in model container [2023-11-29 01:08:32,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:32" (2/3) ... [2023-11-29 01:08:32,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8a0c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:08:32, skipping insertion in model container [2023-11-29 01:08:32,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:08:32" (3/3) ... [2023-11-29 01:08:32,752 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton.c.p+cfa-reducer.c [2023-11-29 01:08:32,767 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:08:32,767 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:08:32,807 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:08:32,813 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;@32b25859, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:08:32,813 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:08:32,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 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 01:08:32,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 01:08:32,824 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:08:32,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:08:32,824 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:08:32,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:08:32,829 INFO L85 PathProgramCache]: Analyzing trace with hash 393727633, now seen corresponding path program 1 times [2023-11-29 01:08:32,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:08:32,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827305117] [2023-11-29 01:08:32,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:08:32,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:08:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:08:33,072 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 01:08:33,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:08:33,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827305117] [2023-11-29 01:08:33,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827305117] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:08:33,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:08:33,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:08:33,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136305502] [2023-11-29 01:08:33,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:08:33,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:08:33,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:08:33,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:08:33,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:08:33,110 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 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 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 01:08:33,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:08:33,173 INFO L93 Difference]: Finished difference Result 50 states and 73 transitions. [2023-11-29 01:08:33,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:08:33,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2023-11-29 01:08:33,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:08:33,184 INFO L225 Difference]: With dead ends: 50 [2023-11-29 01:08:33,184 INFO L226 Difference]: Without dead ends: 38 [2023-11-29 01:08:33,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:08:33,190 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 36 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:08:33,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 70 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:08:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-29 01:08:33,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2023-11-29 01:08:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:08:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2023-11-29 01:08:33,251 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 12 [2023-11-29 01:08:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:08:33,251 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2023-11-29 01:08:33,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 01:08:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2023-11-29 01:08:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 01:08:33,252 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:08:33,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:08:33,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:08:33,253 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:08:33,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:08:33,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1272790163, now seen corresponding path program 1 times [2023-11-29 01:08:33,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:08:33,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345155485] [2023-11-29 01:08:33,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:08:33,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:08:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:08:33,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 01:08:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 01:08:33,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 01:08:33,326 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 01:08:33,328 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 01:08:33,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:08:33,333 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-29 01:08:33,336 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 01:08:33,356 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem5 could not be translated [2023-11-29 01:08:33,357 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet6 could not be translated [2023-11-29 01:08:33,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 01:08:33 BoogieIcfgContainer [2023-11-29 01:08:33,370 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 01:08:33,371 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 01:08:33,371 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 01:08:33,371 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 01:08:33,371 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:08:32" (3/4) ... [2023-11-29 01:08:33,373 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 01:08:33,374 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 01:08:33,375 INFO L158 Benchmark]: Toolchain (without parser) took 1301.54ms. Allocated memory was 161.5MB in the beginning and 211.8MB in the end (delta: 50.3MB). Free memory was 114.6MB in the beginning and 173.7MB in the end (delta: -59.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:08:33,375 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 161.5MB. Free memory is still 132.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:08:33,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.22ms. Allocated memory is still 161.5MB. Free memory was 114.3MB in the beginning and 102.9MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 01:08:33,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.06ms. Allocated memory is still 161.5MB. Free memory was 102.9MB in the beginning and 101.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:08:33,377 INFO L158 Benchmark]: Boogie Preprocessor took 45.54ms. Allocated memory is still 161.5MB. Free memory was 101.3MB in the beginning and 99.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:08:33,378 INFO L158 Benchmark]: RCFGBuilder took 326.37ms. Allocated memory is still 161.5MB. Free memory was 99.1MB in the beginning and 85.6MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 01:08:33,378 INFO L158 Benchmark]: TraceAbstraction took 623.83ms. Allocated memory was 161.5MB in the beginning and 211.8MB in the end (delta: 50.3MB). Free memory was 85.0MB in the beginning and 174.8MB in the end (delta: -89.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:08:33,379 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 211.8MB. Free memory was 174.8MB in the beginning and 173.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 01:08:33,382 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 161.5MB. Free memory is still 132.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.22ms. Allocated memory is still 161.5MB. Free memory was 114.3MB in the beginning and 102.9MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.06ms. Allocated memory is still 161.5MB. Free memory was 102.9MB in the beginning and 101.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.54ms. Allocated memory is still 161.5MB. Free memory was 101.3MB in the beginning and 99.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 326.37ms. Allocated memory is still 161.5MB. Free memory was 99.1MB in the beginning and 85.6MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 623.83ms. Allocated memory was 161.5MB in the beginning and 211.8MB in the end (delta: 50.3MB). Free memory was 85.0MB in the beginning and 174.8MB in the end (delta: -89.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 211.8MB. Free memory was 174.8MB in the beginning and 173.7MB 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~mem5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet6 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: 96]: 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 83, overapproximation of to_real at line 46, overapproximation of someBinaryArithmeticDOUBLEoperation at line 53. Possible FailurePath: [L1] int __return_main; [L17] double __return_104; [L20] double main__a; [L21] double main__r; [L22] main__a = __VERIFIER_nondet_double() [L23] int main____CPAchecker_TMP_0; VAL [__return_104=0, __return_main=0] [L24] COND TRUE main__a >= 20.0 VAL [__return_104=0, __return_main=0] [L26] COND TRUE main__a <= 30.0 [L28] main____CPAchecker_TMP_0 = 1 VAL [__return_104=0, __return_main=0, main____CPAchecker_TMP_0=1] [L30] COND TRUE main____CPAchecker_TMP_0 != 0 [L33] double __tmp_1; [L34] __tmp_1 = main__a [L35] double inv__A; [L36] inv__A = __tmp_1 [L37] double inv__xi; [L38] double inv__xsi; [L39] double inv__temp; [L40] signed int inv__cond; [L41] signed int inv__exp; [L42] union double_int inv__A_u; [L43] union double_int inv__xi_u; [L44] inv__A_u.d = inv__A [L45] EXPR inv__A_u.i VAL [__return_104=0, __return_main=0] [L45] EXPR (inv__A_u.i) & 2146435072 VAL [__return_104=0, __return_main=0, __tmp_1=2145386510, inv__A=2145386510, inv__A_u={5:0}, inv__xi_u={4:0}, main____CPAchecker_TMP_0=1, main__a=2145386510] [L45] inv__exp = ((signed int)(((inv__A_u.i) & 2146435072) >> 20)) - 1023 [L46] inv__xi_u.d = 1 [L47] inv__xi_u.i = (1023 - inv__exp) << 20 [L48] EXPR inv__xi_u.d [L48] inv__xi = inv__xi_u.d [L49] inv__cond = 1 VAL [__return_104=0, __return_main=0, __tmp_1=2145386510, inv__A=2145386510, inv__A_u={5:0}, inv__cond=1, inv__exp=-1023, inv__xi=2145386511, inv__xi_u={4:0}, main____CPAchecker_TMP_0=1, main__a=2145386510] [L51] COND TRUE !(inv__cond == 0) [L53] inv__xsi = (2 * inv__xi) - ((inv__A * inv__xi) * inv__xi) [L54] inv__temp = inv__xsi - inv__xi [L55] int inv____CPAchecker_TMP_0; VAL [__return_104=0, __return_main=0, __tmp_1=2145386510, inv__A=2145386510, inv__A_u={5:0}, inv__cond=1, inv__exp=-1023, inv__xi=2145386511, inv__xi_u={4:0}, main____CPAchecker_TMP_0=1, main__a=2145386510] [L56] COND FALSE !(inv__temp > 1.0E-10) VAL [__return_104=0, __return_main=0, __tmp_1=2145386510, inv__A=2145386510, inv__A_u={5:0}, inv__cond=1, inv__exp=-1023, inv__xi=2145386511, inv__xi_u={4:0}, main____CPAchecker_TMP_0=1, main__a=2145386510] [L67] COND FALSE !(inv__temp < -1.0E-10) [L73] inv____CPAchecker_TMP_0 = 0 VAL [__return_104=0, __return_main=0, __tmp_1=2145386510, inv__A=2145386510, inv__A_u={5:0}, inv____CPAchecker_TMP_0=0, inv__cond=1, inv__exp=-1023, inv__xi=2145386511, inv__xi_u={4:0}, main____CPAchecker_TMP_0=1, main__a=2145386510] [L61] inv__cond = inv____CPAchecker_TMP_0 [L62] inv__xi = inv__xsi VAL [__return_104=0, __return_main=0, __tmp_1=2145386510, inv__A=2145386510, inv__A_u={5:0}, inv____CPAchecker_TMP_0=0, inv__cond=0, inv__exp=-1023, inv__xi=2145386512, inv__xi_u={4:0}, inv__xsi=2145386512, main____CPAchecker_TMP_0=1, main__a=2145386510] [L51] COND FALSE !(!(inv__cond == 0)) [L80] __return_104 = inv__xi [L81] main__r = __return_104 [L82] int main____CPAchecker_TMP_1; VAL [__return_104=2145386512, __return_main=0, __tmp_1=2145386510, inv__A=2145386510, inv__A_u={5:0}, inv____CPAchecker_TMP_0=0, inv__cond=0, inv__exp=-1023, inv__xi=2145386512, inv__xi_u={4:0}, inv__xsi=2145386512, main____CPAchecker_TMP_0=1, main__a=2145386510, main__r=2145386512] [L83] COND FALSE !(main__r >= 0) VAL [__return_104=2145386512, __return_main=0, __tmp_1=2145386510, inv__A=2145386510, inv__A_u={5:0}, inv____CPAchecker_TMP_0=0, inv__cond=0, inv__exp=-1023, inv__xi=2145386512, inv__xi_u={4:0}, inv__xsi=2145386512, main____CPAchecker_TMP_0=1, main__a=2145386510, main__r=2145386512] [L108] main____CPAchecker_TMP_1 = 0 VAL [__return_104=2145386512, __return_main=0, __tmp_1=2145386510, inv__A=2145386510, inv__A_u={5:0}, inv____CPAchecker_TMP_0=0, inv__cond=0, inv__exp=-1023, inv__xi=2145386512, inv__xi_u={4:0}, inv__xsi=2145386512, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386510, main__r=2145386512] [L90] int __tmp_2; [L91] __tmp_2 = main____CPAchecker_TMP_1 [L92] int __VERIFIER_assert__cond; [L93] __VERIFIER_assert__cond = __tmp_2 VAL [__VERIFIER_assert__cond=0, __return_104=2145386512, __return_main=0, __tmp_1=2145386510, __tmp_2=0, inv__A=2145386510, inv__A_u={5:0}, inv____CPAchecker_TMP_0=0, inv__cond=0, inv__exp=-1023, inv__xi=2145386512, inv__xi_u={4:0}, inv__xsi=2145386512, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386510, main__r=2145386512] [L94] COND TRUE __VERIFIER_assert__cond == 0 VAL [__VERIFIER_assert__cond=0, __return_104=2145386512, __return_main=0, __tmp_1=2145386510, __tmp_2=0, inv__A=2145386510, inv__A_u={5:0}, inv____CPAchecker_TMP_0=0, inv__cond=0, inv__exp=-1023, inv__xi=2145386512, inv__xi_u={4:0}, inv__xsi=2145386512, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386510, main__r=2145386512] [L96] reach_error() VAL [__VERIFIER_assert__cond=0, __return_104=2145386512, __return_main=0, __tmp_1=2145386510, __tmp_2=0, inv__A=2145386510, inv__A_u={5:0}, inv____CPAchecker_TMP_0=0, inv__cond=0, inv__exp=-1023, inv__xi=2145386512, inv__xi_u={4:0}, inv__xsi=2145386512, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=2145386510, main__r=2145386512] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 27 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred 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, 1 MinimizatonAttempts, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 16 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 01:08:33,402 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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_402ec212-680f-4d0b-bb52-496d0f781bb4/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 f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:08:35,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:08:35,396 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 01:08:35,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:08:35,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:08:35,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:08:35,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:08:35,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:08:35,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:08:35,441 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:08:35,442 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:08:35,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:08:35,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:08:35,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:08:35,444 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:08:35,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:08:35,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:08:35,446 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:08:35,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:08:35,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:08:35,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:08:35,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:08:35,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:08:35,450 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:08:35,450 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 01:08:35,451 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 01:08:35,451 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:08:35,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:08:35,451 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:08:35,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:08:35,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:08:35,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:08:35,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:08:35,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:08:35,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:08:35,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:08:35,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:08:35,454 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 01:08:35,454 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 01:08:35,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:08:35,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:08:35,455 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:08:35,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:08:35,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:08:35,455 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 01:08:35,456 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_402ec212-680f-4d0b-bb52-496d0f781bb4/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_402ec212-680f-4d0b-bb52-496d0f781bb4/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 -> f807884dfe796c964ede5317ceef5bdc8dc93cb7b5e0611cc0dc63f2d13b17a0 [2023-11-29 01:08:35,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:08:35,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:08:35,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:08:35,747 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:08:35,748 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:08:35,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2023-11-29 01:08:38,539 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:08:38,714 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:08:38,715 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c [2023-11-29 01:08:38,722 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/data/5b1dca1a8/2737508c8d9d42fd84c791c77afaaffd/FLAGc9592e7ca [2023-11-29 01:08:38,735 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/data/5b1dca1a8/2737508c8d9d42fd84c791c77afaaffd [2023-11-29 01:08:38,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:08:38,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:08:38,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:08:38,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:08:38,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:08:38,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:08:38" (1/1) ... [2023-11-29 01:08:38,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c9dd15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:38, skipping insertion in model container [2023-11-29 01:08:38,746 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:08:38" (1/1) ... [2023-11-29 01:08:38,783 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:08:38,954 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_402ec212-680f-4d0b-bb52-496d0f781bb4/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2023-11-29 01:08:38,961 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:08:38,975 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:08:38,999 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_402ec212-680f-4d0b-bb52-496d0f781bb4/sv-benchmarks/c/float-benchs/inv_Newton.c.p+cfa-reducer.c[2006,2019] [2023-11-29 01:08:39,002 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:08:39,023 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:08:39,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:39 WrapperNode [2023-11-29 01:08:39,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:08:39,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:08:39,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:08:39,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:08:39,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:39" (1/1) ... [2023-11-29 01:08:39,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:39" (1/1) ... [2023-11-29 01:08:39,065 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 103 [2023-11-29 01:08:39,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:08:39,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:08:39,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:08:39,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:08:39,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:39" (1/1) ... [2023-11-29 01:08:39,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:39" (1/1) ... [2023-11-29 01:08:39,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:39" (1/1) ... [2023-11-29 01:08:39,098 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 01:08:39,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:39" (1/1) ... [2023-11-29 01:08:39,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:39" (1/1) ... [2023-11-29 01:08:39,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:39" (1/1) ... [2023-11-29 01:08:39,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:39" (1/1) ... [2023-11-29 01:08:39,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:39" (1/1) ... [2023-11-29 01:08:39,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:39" (1/1) ... [2023-11-29 01:08:39,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:08:39,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:08:39,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:08:39,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:08:39,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:39" (1/1) ... [2023-11-29 01:08:39,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:08:39,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:08:39,151 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:08:39,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:08:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:08:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-11-29 01:08:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-11-29 01:08:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2023-11-29 01:08:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-11-29 01:08:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-11-29 01:08:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2023-11-29 01:08:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 01:08:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 01:08:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 01:08:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:08:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 01:08:39,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 01:08:39,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 01:08:39,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:08:39,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:08:39,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:08:39,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 01:08:39,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 01:08:39,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 01:08:39,283 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:08:39,285 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:08:43,606 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:08:43,628 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:08:43,628 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 01:08:43,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:08:43 BoogieIcfgContainer [2023-11-29 01:08:43,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:08:43,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:08:43,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:08:43,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:08:43,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:08:38" (1/3) ... [2023-11-29 01:08:43,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b62268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:08:43, skipping insertion in model container [2023-11-29 01:08:43,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:08:39" (2/3) ... [2023-11-29 01:08:43,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b62268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:08:43, skipping insertion in model container [2023-11-29 01:08:43,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:08:43" (3/3) ... [2023-11-29 01:08:43,638 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton.c.p+cfa-reducer.c [2023-11-29 01:08:43,655 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:08:43,656 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:08:43,703 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:08:43,710 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;@61e35e81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:08:43,710 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:08:43,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 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 01:08:43,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 01:08:43,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:08:43,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:08:43,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:08:43,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:08:43,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1934553295, now seen corresponding path program 1 times [2023-11-29 01:08:43,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:08:43,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242253679] [2023-11-29 01:08:43,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:08:43,742 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 01:08:43,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:08:43,743 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 01:08:43,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 01:08:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:08:43,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:08:43,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:08:43,922 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 01:08:43,923 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:08:43,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:08:43,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242253679] [2023-11-29 01:08:43,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242253679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:08:43,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:08:43,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:08:43,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277648717] [2023-11-29 01:08:43,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:08:43,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:08:43,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:08:43,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:08:43,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:08:43,953 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 01:08:48,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:08:52,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:08:52,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:08:52,775 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2023-11-29 01:08:52,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:08:52,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2023-11-29 01:08:52,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:08:52,878 INFO L225 Difference]: With dead ends: 33 [2023-11-29 01:08:52,878 INFO L226 Difference]: Without dead ends: 22 [2023-11-29 01:08:52,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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 01:08:52,883 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:08:52,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2023-11-29 01:08:52,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-29 01:08:52,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2023-11-29 01:08:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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 01:08:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2023-11-29 01:08:52,906 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 10 [2023-11-29 01:08:52,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:08:52,906 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2023-11-29 01:08:52,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 01:08:52,907 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2023-11-29 01:08:52,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 01:08:52,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:08:52,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:08:52,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 01:08:53,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 01:08:53,109 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:08:53,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:08:53,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1483588724, now seen corresponding path program 1 times [2023-11-29 01:08:53,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:08:53,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121191368] [2023-11-29 01:08:53,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:08:53,111 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 01:08:53,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:08:53,112 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 01:08:53,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 01:08:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:08:53,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:08:53,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:08:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:08:53,825 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:08:53,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:08:53,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121191368] [2023-11-29 01:08:53,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121191368] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:08:53,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:08:53,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:08:53,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593179224] [2023-11-29 01:08:53,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:08:53,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:08:53,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:08:53,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:08:53,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:08:53,829 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 01:08:58,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:09:02,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:09:06,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:09:10,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:09:14,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:09:18,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:09:18,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:09:18,909 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2023-11-29 01:09:19,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:09:19,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Word has length 14 [2023-11-29 01:09:19,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:09:19,002 INFO L225 Difference]: With dead ends: 32 [2023-11-29 01:09:19,002 INFO L226 Difference]: Without dead ends: 25 [2023-11-29 01:09:19,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:09:19,004 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:09:19,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 57 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 6 Unknown, 0 Unchecked, 24.9s Time] [2023-11-29 01:09:19,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-29 01:09:19,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2023-11-29 01:09:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:09:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2023-11-29 01:09:19,010 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 14 [2023-11-29 01:09:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:09:19,011 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2023-11-29 01:09:19,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 01:09:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2023-11-29 01:09:19,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 01:09:19,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:09:19,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:09:19,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 01:09:19,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 01:09:19,213 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:09:19,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:09:19,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2029187665, now seen corresponding path program 1 times [2023-11-29 01:09:19,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:09:19,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549888612] [2023-11-29 01:09:19,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:09:19,215 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 01:09:19,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:09:19,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 01:09:19,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 01:09:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:09:19,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:09:19,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:09:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:09:19,894 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:09:19,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:09:19,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549888612] [2023-11-29 01:09:19,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549888612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:09:19,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:09:19,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:09:19,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526543563] [2023-11-29 01:09:19,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:09:19,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:09:19,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:09:19,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:09:19,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:09:19,898 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 01:09:19,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:09:19,976 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2023-11-29 01:09:19,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:09:19,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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) Word has length 14 [2023-11-29 01:09:19,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:09:19,978 INFO L225 Difference]: With dead ends: 23 [2023-11-29 01:09:19,978 INFO L226 Difference]: Without dead ends: 19 [2023-11-29 01:09:19,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:09:19,980 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:09:19,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:09:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-29 01:09:19,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-29 01:09:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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 01:09:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2023-11-29 01:09:19,985 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 14 [2023-11-29 01:09:19,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:09:19,985 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2023-11-29 01:09:19,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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 01:09:19,985 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2023-11-29 01:09:19,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 01:09:19,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:09:19,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:09:20,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 01:09:20,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 01:09:20,191 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:09:20,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:09:20,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2046198326, now seen corresponding path program 1 times [2023-11-29 01:09:20,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:09:20,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137288553] [2023-11-29 01:09:20,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:09:20,192 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 01:09:20,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:09:20,193 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 01:09:20,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 01:09:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:09:21,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 01:09:21,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:09:29,724 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:09:38,106 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 01:09:46,415 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:09:54,785 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:10:03,007 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:10:07,103 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0)) |c_ULTIMATE.start_main_~inv__xsi~0#1|) (= |c_ULTIMATE.start_main_~inv__temp~0#1| (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 01:10:15,445 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:10:23,893 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 01:10:32,292 WARN L293 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:10:40,680 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:10:48,899 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:10:53,012 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0)) |c_ULTIMATE.start_main_~inv__xsi~0#1|) (= |c_ULTIMATE.start_main_~inv__temp~0#1| (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0))))) (not (fp.gt |c_ULTIMATE.start_main_~inv__temp~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 01:11:01,375 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:11:09,721 WARN L293 SmtUtils]: Spent 8.35s 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 01:11:18,073 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:11:26,546 WARN L293 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:11:34,971 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:11:43,209 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:11:47,317 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse2)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (not (fp.lt .cse0 (fp.neg .cse1))) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse2) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse2) .cse2)) |c_ULTIMATE.start_main_~inv__xsi~0#1|) (not (fp.gt .cse0 .cse1)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 01:11:55,854 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 01:12:04,305 WARN L293 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:12:12,674 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:12:21,058 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:12:29,427 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:12:37,951 WARN L293 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:12:42,065 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse3) .cse3)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (= .cse0 |c_ULTIMATE.start_main_~inv__xi~0#1|) (not (fp.gt .cse1 .cse2)) (not (fp.lt .cse1 (fp.neg .cse2))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 01:12:50,466 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 01:12:58,842 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:13:07,293 WARN L293 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:13:15,669 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:13:24,041 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:13:32,499 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:13:36,618 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse3) .cse3)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (= .cse2 |c_ULTIMATE.start_main_~main__r~0#1|) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 01:13:49,668 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:13:58,139 WARN L293 SmtUtils]: Spent 8.47s 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 01:14:06,521 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:14:15,001 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:14:23,477 WARN L293 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:14:27,588 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~inv__A~0#1| .cse1) .cse1)))) (and (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (not (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 20.0)))))) is different from false [2023-11-29 01:14:31,652 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse1) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~inv__A~0#1| .cse1) .cse1)))) (and (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (fp.lt (fp.sub roundNearestTiesToEven .cse0 .cse1) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (not (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 20.0)))))) is different from true [2023-11-29 01:14:44,300 WARN L293 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:14:52,769 WARN L293 SmtUtils]: Spent 8.47s 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 01:15:01,146 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:15:09,621 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:15:18,093 WARN L293 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:15:30,591 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:15:39,073 WARN L293 SmtUtils]: Spent 8.48s 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 01:15:47,453 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:15:55,942 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:16:04,430 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:16:16,983 WARN L293 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:16:25,467 WARN L293 SmtUtils]: Spent 8.48s 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 01:16:33,856 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:16:42,507 WARN L293 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:16:51,040 WARN L293 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:16:51,041 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 01:16:51,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:17:00,620 WARN L293 SmtUtils]: Spent 8.57s 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 01:17:09,066 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:17:17,513 WARN L293 SmtUtils]: Spent 8.45s 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 01:17:21,656 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~inv__xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~inv__A~0#1| |c_ULTIMATE.start_main_~inv__xi~0#1|) |c_ULTIMATE.start_main_~inv__xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~inv__xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse0 .cse1)))) is different from false [2023-11-29 01:17:25,816 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~inv__xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~inv__A~0#1| |c_ULTIMATE.start_main_~inv__xi~0#1|) |c_ULTIMATE.start_main_~inv__xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~inv__xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse0 .cse1)))) is different from true [2023-11-29 01:17:34,358 WARN L293 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:17:42,803 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:17:49,233 WARN L293 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 25 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:17:57,681 WARN L293 SmtUtils]: Spent 8.45s 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 01:18:02,204 WARN L876 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_9| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_9|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))))) is different from true [2023-11-29 01:18:11,103 WARN L293 SmtUtils]: Spent 8.89s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:18:19,585 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:18:28,169 WARN L293 SmtUtils]: Spent 8.58s 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 01:18:32,325 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_9| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_9|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))))) (not (fp.leq |c_ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)))) is different from true [2023-11-29 01:18:41,502 WARN L293 SmtUtils]: Spent 9.17s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:18:49,991 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:18:58,572 WARN L293 SmtUtils]: Spent 8.58s 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 01:19:02,735 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__a~0#1| (_ FloatingPoint 11 53))) (or (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_9| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_9|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) (not (fp.leq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (not (fp.geq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0))))) is different from false [2023-11-29 01:19:06,848 WARN L876 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__a~0#1| (_ FloatingPoint 11 53))) (or (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_9| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_9|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) (not (fp.leq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (not (fp.geq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0))))) is different from true [2023-11-29 01:19:06,849 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 01:19:06,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:19:06,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137288553] [2023-11-29 01:19:06,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137288553] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:19:06,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:19:06,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2023-11-29 01:19:06,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287141894] [2023-11-29 01:19:06,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:19:06,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 01:19:06,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:19:06,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 01:19:06,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=90, Unknown=13, NotChecked=270, Total=420 [2023-11-29 01:19:06,852 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 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 01:19:11,077 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~main__a~0#1| (_ FloatingPoint 11 53))) (or (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_9| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_9|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) (not (fp.leq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (not (fp.geq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 01:19:15,256 WARN L876 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~main__a~0#1| (_ FloatingPoint 11 53))) (or (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_9| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_9|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) (not (fp.leq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (not (fp.geq |ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-29 01:19:19,656 WARN L876 $PredicateComparison]: unable to prove that (and (fp.geq |c_ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (or (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_9| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_9|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))))) (not (fp.leq |c_ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-29 01:19:23,721 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_9| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_9|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))))) (fp.geq |c_ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq |c_ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 01:19:27,853 WARN L876 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~inv__exp~0#1_9| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse1 (let ((.cse2 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |v_ULTIMATE.start_main_~inv__exp~0#1_9|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse1) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~main__a~0#1| .cse1) .cse1)))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse1) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))))) (fp.geq |c_ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq |c_ULTIMATE.start_main_~main__a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-29 01:19:31,990 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~inv__xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~inv__A~0#1| |c_ULTIMATE.start_main_~inv__xi~0#1|) |c_ULTIMATE.start_main_~inv__xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~inv__xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse0 .cse1)))) (fp.leq |c_ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~inv__xi~0#1| (let ((.cse3 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (fp.geq |c_ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 01:19:36,172 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~inv__xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~inv__A~0#1| |c_ULTIMATE.start_main_~inv__xi~0#1|) |c_ULTIMATE.start_main_~inv__xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~inv__xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.gt .cse0 .cse1)))) (fp.leq |c_ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~inv__xi~0#1| (let ((.cse3 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (fp.geq |c_ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-29 01:19:40,448 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0)) |c_ULTIMATE.start_main_~inv__xsi~0#1|) (= |c_ULTIMATE.start_main_~inv__temp~0#1| (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0))))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.gt |c_ULTIMATE.start_main_~inv__temp~0#1| .cse2) (fp.lt |c_ULTIMATE.start_main_~inv__temp~0#1| (fp.neg .cse2)) (fp.geq |c_ULTIMATE.start_main_~inv__xsi~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 01:19:44,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:19:48,915 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 01:19:52,921 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 01:19:56,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:00,939 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 01:20:04,943 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 01:20:08,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:12,961 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 01:20:16,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:21,269 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse1 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0)) |c_ULTIMATE.start_main_~inv__xsi~0#1|) (= |c_ULTIMATE.start_main_~inv__temp~0#1| (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0))))) (or (fp.lt |c_ULTIMATE.start_main_~inv__temp~0#1| (fp.neg .cse2)) (fp.geq |c_ULTIMATE.start_main_~inv__xsi~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (not (fp.gt |c_ULTIMATE.start_main_~inv__temp~0#1| .cse2)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-29 01:20:26,011 WARN L854 $PredicateComparison]: unable to prove that (and (fp.geq |c_ULTIMATE.start_main_~inv__xsi~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 (let ((.cse3 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse2)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (not (fp.lt .cse0 (fp.neg .cse1))) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse2) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse2) .cse2)) |c_ULTIMATE.start_main_~inv__xsi~0#1|) (not (fp.gt .cse0 .cse1)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 01:20:30,747 WARN L854 $PredicateComparison]: unable to prove that (and (fp.geq |c_ULTIMATE.start_main_~inv__xi~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse3) .cse3)))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse0 .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (= .cse0 |c_ULTIMATE.start_main_~inv__xi~0#1|) (not (fp.gt .cse1 .cse2)) (not (fp.lt .cse1 (fp.neg .cse2))) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 01:20:35,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.49s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:39,465 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 01:20:43,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:47,479 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 01:20:51,483 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 01:20:55,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:20:59,497 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 01:21:03,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:21:07,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:21:11,849 WARN L854 $PredicateComparison]: unable to prove that (and (fp.geq |c_ULTIMATE.start_main_~main__r~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (exists ((|ULTIMATE.start_main_~inv__exp~0#1| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) (bvshl (bvadd (_ bv1023 32) (bvneg |ULTIMATE.start_main_~inv__exp~0#1|)) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse3) .cse3)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (= .cse2 |c_ULTIMATE.start_main_~main__r~0#1|) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 01:21:16,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:21:20,334 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 01:21:24,349 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 01:21:28,356 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 01:21:32,359 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 01:21:36,368 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 01:21:40,378 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 01:21:44,382 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 [0] [2023-11-29 01:21:48,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:21:52,397 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 01:21:56,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:22:00,612 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 01:22:03,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:22:08,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 01:22:12,392 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 01:22:16,397 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 01:22:20,401 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 01:22:24,404 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 01:22:28,408 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 01:22:32,414 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 01:22:36,421 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 01:22:40,427 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 01:22:44,429 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 01:22:45,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:22:45,169 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2023-11-29 01:22:45,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 01:22:45,171 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 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 14 [2023-11-29 01:22:45,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:22:45,173 INFO L225 Difference]: With dead ends: 51 [2023-11-29 01:22:45,173 INFO L226 Difference]: Without dead ends: 46 [2023-11-29 01:22:45,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 105.7s TimeCoverageRelationStatistics Valid=75, Invalid=132, Unknown=25, NotChecked=760, Total=992 [2023-11-29 01:22:45,176 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 166.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 619 IncrementalHoareTripleChecker+Unchecked, 167.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:22:45,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 129 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 40 Unknown, 619 Unchecked, 167.4s Time] [2023-11-29 01:22:45,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-29 01:22:45,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 26. [2023-11-29 01:22:45,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 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 01:22:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2023-11-29 01:22:45,183 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 14 [2023-11-29 01:22:45,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:22:45,183 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2023-11-29 01:22:45,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 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 01:22:45,183 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2023-11-29 01:22:45,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 01:22:45,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:22:45,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:22:45,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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)] Forceful destruction successful, exit code 0 [2023-11-29 01:22:45,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 01:22:45,385 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:22:45,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:22:45,386 INFO L85 PathProgramCache]: Analyzing trace with hash 788783195, now seen corresponding path program 1 times [2023-11-29 01:22:45,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:22:45,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267074314] [2023-11-29 01:22:45,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:45,386 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 01:22:45,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:22:45,387 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 01:22:45,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 (6)] Waiting until timeout for monitored process [2023-11-29 01:22:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:45,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:22:45,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:22:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 01:22:46,115 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:22:46,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:22:46,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267074314] [2023-11-29 01:22:46,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267074314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:22:46,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:22:46,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:22:46,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472404443] [2023-11-29 01:22:46,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:22:46,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:22:46,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:22:46,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:22:46,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:22:46,118 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 01:22:46,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:22:46,213 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2023-11-29 01:22:46,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:22:46,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) Word has length 14 [2023-11-29 01:22:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:22:46,217 INFO L225 Difference]: With dead ends: 40 [2023-11-29 01:22:46,217 INFO L226 Difference]: Without dead ends: 24 [2023-11-29 01:22:46,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:22:46,218 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:22:46,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 01:22:46,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-29 01:22:46,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-29 01:22:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:22:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2023-11-29 01:22:46,222 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 14 [2023-11-29 01:22:46,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:22:46,222 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2023-11-29 01:22:46,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 01:22:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2023-11-29 01:22:46,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 01:22:46,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:22:46,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:22:46,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 (6)] Ended with exit code 0 [2023-11-29 01:22:46,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 01:22:46,424 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:22:46,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:22:46,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1509208263, now seen corresponding path program 1 times [2023-11-29 01:22:46,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:22:46,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156743269] [2023-11-29 01:22:46,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:22:46,425 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 01:22:46,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:22:46,426 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 01:22:46,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402ec212-680f-4d0b-bb52-496d0f781bb4/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 (7)] Waiting until timeout for monitored process [2023-11-29 01:22:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:22:58,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 01:22:58,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:22:59,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 60 [2023-11-29 01:22:59,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2023-11-29 01:23:07,973 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:23:16,475 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:23:24,982 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:23:30,844 WARN L293 SmtUtils]: Spent 5.86s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:23:35,155 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~inv__A~0#1| (_ FloatingPoint 11 53)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (let ((.cse1 (concat v_arrayElimCell_1 (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand v_arrayElimCell_2 (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (fp.geq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~inv__A~0#1| .cse0) .cse0)) |c_ULTIMATE.start_main_~inv__xsi~0#1|) (fp.leq |ULTIMATE.start_main_~inv__A~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~inv__xsi~0#1| .cse0) |c_ULTIMATE.start_main_~inv__temp~0#1|)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 01:23:43,501 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 01:23:52,117 WARN L293 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)