./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/inv_Newton-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67155ca1e686450fca2a6f4b9f638c838555b88a3546adff9656d040c859ca12 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:53:04,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:53:04,369 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:53:04,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:53:04,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:53:04,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:53:04,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:53:04,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:53:04,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:53:04,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:53:04,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:53:04,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:53:04,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:53:04,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:53:04,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:53:04,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:53:04,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:53:04,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:53:04,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:53:04,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:53:04,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:53:04,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:53:04,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:53:04,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:53:04,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:53:04,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:53:04,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:53:04,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:53:04,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:53:04,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:53:04,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:53:04,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:53:04,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:53:04,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:53:04,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:53:04,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:53:04,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:53:04,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:53:04,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:53:04,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:53:04,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:53:04,450 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:53:04,472 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:53:04,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:53:04,473 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:53:04,473 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:53:04,474 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:53:04,474 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:53:04,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:53:04,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:53:04,475 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:53:04,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:53:04,476 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:53:04,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:53:04,476 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:53:04,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:53:04,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:53:04,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:53:04,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:53:04,478 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:53:04,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:53:04,478 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:53:04,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:53:04,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:53:04,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:53:04,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:53:04,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:04,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:53:04,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:53:04,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:53:04,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:53:04,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:53:04,481 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:53:04,481 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:53:04,481 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:53:04,482 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/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_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 67155ca1e686450fca2a6f4b9f638c838555b88a3546adff9656d040c859ca12 [2022-11-02 20:53:04,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:53:04,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:53:04,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:53:04,847 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:53:04,848 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:53:04,871 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/float-benchs/inv_Newton-2.c [2022-11-02 20:53:04,960 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/data/1b1c75ffc/719e3c91323440958de707abcf5bc1b2/FLAG1f255ac16 [2022-11-02 20:53:05,522 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:53:05,524 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/sv-benchmarks/c/float-benchs/inv_Newton-2.c [2022-11-02 20:53:05,532 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/data/1b1c75ffc/719e3c91323440958de707abcf5bc1b2/FLAG1f255ac16 [2022-11-02 20:53:05,967 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/data/1b1c75ffc/719e3c91323440958de707abcf5bc1b2 [2022-11-02 20:53:05,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:53:05,973 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:53:05,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:05,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:53:05,978 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:53:05,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:05" (1/1) ... [2022-11-02 20:53:05,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f6dee00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:05, skipping insertion in model container [2022-11-02 20:53:05,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:05" (1/1) ... [2022-11-02 20:53:05,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:53:06,006 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:53:06,185 WARN L230 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_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/sv-benchmarks/c/float-benchs/inv_Newton-2.c[847,860] [2022-11-02 20:53:06,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:06,209 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:53:06,220 WARN L230 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_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/sv-benchmarks/c/float-benchs/inv_Newton-2.c[847,860] [2022-11-02 20:53:06,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:06,241 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:53:06,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:06 WrapperNode [2022-11-02 20:53:06,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:06,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:06,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:53:06,242 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:53:06,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:06" (1/1) ... [2022-11-02 20:53:06,270 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:06" (1/1) ... [2022-11-02 20:53:06,294 INFO L138 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 66 [2022-11-02 20:53:06,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:06,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:53:06,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:53:06,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:53:06,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:06" (1/1) ... [2022-11-02 20:53:06,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:06" (1/1) ... [2022-11-02 20:53:06,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:06" (1/1) ... [2022-11-02 20:53:06,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:06" (1/1) ... [2022-11-02 20:53:06,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:06" (1/1) ... [2022-11-02 20:53:06,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:06" (1/1) ... [2022-11-02 20:53:06,316 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:06" (1/1) ... [2022-11-02 20:53:06,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:06" (1/1) ... [2022-11-02 20:53:06,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:53:06,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:53:06,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:53:06,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:53:06,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:06" (1/1) ... [2022-11-02 20:53:06,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:06,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:06,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:53:06,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:53:06,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:53:06,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:53:06,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:53:06,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-11-02 20:53:06,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:53:06,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-11-02 20:53:06,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:53:06,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:53:06,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:53:06,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:53:06,503 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:53:06,522 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:53:06,804 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:53:06,809 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:53:06,810 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:53:06,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:06 BoogieIcfgContainer [2022-11-02 20:53:06,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:53:06,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:53:06,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:53:06,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:53:06,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:53:05" (1/3) ... [2022-11-02 20:53:06,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727c641e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:53:06, skipping insertion in model container [2022-11-02 20:53:06,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:06" (2/3) ... [2022-11-02 20:53:06,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727c641e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:53:06, skipping insertion in model container [2022-11-02 20:53:06,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:06" (3/3) ... [2022-11-02 20:53:06,827 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton-2.c [2022-11-02 20:53:06,849 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:53:06,850 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:53:06,926 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:53:06,937 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=LoopsAndPotentialCycles, 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;@16debec1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:53:06,937 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:53:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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) [2022-11-02 20:53:06,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:53:06,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:06,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:06,952 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:06,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:06,961 INFO L85 PathProgramCache]: Analyzing trace with hash -590190995, now seen corresponding path program 1 times [2022-11-02 20:53:06,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:06,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341346869] [2022-11-02 20:53:06,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:06,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:07,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:07,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341346869] [2022-11-02 20:53:07,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341346869] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:07,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:07,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:07,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662748854] [2022-11-02 20:53:07,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:07,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:53:07,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:07,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:53:07,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:53:07,282 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:07,297 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-11-02 20:53:07,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:53:07,300 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:53:07,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:07,315 INFO L225 Difference]: With dead ends: 25 [2022-11-02 20:53:07,315 INFO L226 Difference]: Without dead ends: 10 [2022-11-02 20:53:07,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:53:07,324 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:07,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:53:07,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-02 20:53:07,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-11-02 20:53:07,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-11-02 20:53:07,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2022-11-02 20:53:07,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:07,367 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-11-02 20:53:07,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-11-02 20:53:07,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:53:07,368 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:07,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:07,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:53:07,370 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:07,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:07,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1184816367, now seen corresponding path program 1 times [2022-11-02 20:53:07,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:07,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869472835] [2022-11-02 20:53:07,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:07,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:07,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:07,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869472835] [2022-11-02 20:53:07,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869472835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:07,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:07,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:53:07,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325658329] [2022-11-02 20:53:07,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:07,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:07,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:07,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:07,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:07,590 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:07,614 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-11-02 20:53:07,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:07,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:53:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:07,617 INFO L225 Difference]: With dead ends: 16 [2022-11-02 20:53:07,617 INFO L226 Difference]: Without dead ends: 11 [2022-11-02 20:53:07,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:07,619 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:07,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:53:07,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-02 20:53:07,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-11-02 20:53:07,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-11-02 20:53:07,624 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-11-02 20:53:07,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:07,624 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-11-02 20:53:07,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-11-02 20:53:07,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:53:07,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:07,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:07,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:53:07,626 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:07,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:07,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1873743609, now seen corresponding path program 1 times [2022-11-02 20:53:07,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:07,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345669049] [2022-11-02 20:53:07,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:07,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:53:07,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:53:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:53:07,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:53:07,746 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:53:07,747 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 20:53:07,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:53:07,754 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-02 20:53:07,758 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:53:07,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:53:07 BoogieIcfgContainer [2022-11-02 20:53:07,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:53:07,803 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:53:07,803 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:53:07,803 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:53:07,804 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:06" (3/4) ... [2022-11-02 20:53:07,807 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:53:07,807 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:53:07,808 INFO L158 Benchmark]: Toolchain (without parser) took 1834.90ms. Allocated memory is still 104.9MB. Free memory was 69.8MB in the beginning and 73.1MB in the end (delta: -3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:53:07,808 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 104.9MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:53:07,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.94ms. Allocated memory is still 104.9MB. Free memory was 69.6MB in the beginning and 81.1MB in the end (delta: -11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:53:07,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.97ms. Allocated memory is still 104.9MB. Free memory was 81.1MB in the beginning and 79.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:53:07,823 INFO L158 Benchmark]: Boogie Preprocessor took 24.57ms. Allocated memory is still 104.9MB. Free memory was 79.4MB in the beginning and 78.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:53:07,823 INFO L158 Benchmark]: RCFGBuilder took 491.81ms. Allocated memory is still 104.9MB. Free memory was 78.1MB in the beginning and 66.4MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 20:53:07,824 INFO L158 Benchmark]: TraceAbstraction took 988.60ms. Allocated memory is still 104.9MB. Free memory was 66.0MB in the beginning and 73.7MB in the end (delta: -7.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:53:07,824 INFO L158 Benchmark]: Witness Printer took 4.51ms. Allocated memory is still 104.9MB. Free memory was 73.7MB in the beginning and 73.1MB in the end (delta: 572.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:53:07,826 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 104.9MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.94ms. Allocated memory is still 104.9MB. Free memory was 69.6MB in the beginning and 81.1MB in the end (delta: -11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.97ms. Allocated memory is still 104.9MB. Free memory was 81.1MB in the beginning and 79.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.57ms. Allocated memory is still 104.9MB. Free memory was 79.4MB in the beginning and 78.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 491.81ms. Allocated memory is still 104.9MB. Free memory was 78.1MB in the beginning and 66.4MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 988.60ms. Allocated memory is still 104.9MB. Free memory was 66.0MB in the beginning and 73.7MB in the end (delta: -7.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.51ms. Allocated memory is still 104.9MB. Free memory was 73.7MB in the beginning and 73.1MB in the end (delta: 572.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 23]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 37, overapproximation of someBinaryArithmeticDOUBLEoperation at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of to_real at line 38. Possible FailurePath: [L53] double a,r; [L55] a = __VERIFIER_nondet_double() [L56] CALL assume_abort_if_not(a >= 20. && a <= 30.) [L21] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L56] RET assume_abort_if_not(a >= 20. && a <= 30.) [L58] CALL, EXPR inv(a) [L33] double xi, xsi, temp; [L34] signed int cond, exp; [L35] union double_int A_u, xi_u; [L36] A_u.d = A [L37] EXPR A_u.i [L37] exp = (signed int) ((A_u.i & 0x7FF00000) >> 20) - 1023 [L38] xi_u.d = 1 [L39] xi_u.i = ((1023-exp) << 20) [L40] EXPR xi_u.d [L40] xi = xi_u.d [L41] cond = 1 VAL [\old(A)=2145386512, A=2145386512, A_u={4:0}, cond=1, exp=-1023, xi=2145386511, xi_u={5:0}] [L42] COND TRUE \read(cond) [L43] xsi = 2*xi-A*xi*xi [L44] temp = xsi-xi [L45] cond = ((temp > 1e-10) || (temp < -1e-10)) [L46] xi = xsi VAL [\old(A)=2145386512, A=2145386512, A_u={4:0}, cond=0, exp=-1023, xi=2145386510, xi_u={5:0}, xsi=2145386510] [L42] COND FALSE !(\read(cond)) VAL [\old(A)=2145386512, A=2145386512, A_u={4:0}, cond=0, exp=-1023, xi=2145386510, xi_u={5:0}, xsi=2145386510] [L48] return xi; [L48] return xi; [L48] return xi; VAL [\old(A)=2145386512, \result=2145386510, A=2145386512, cond=0, exp=-1023, xi=2145386510, xsi=2145386510] [L58] RET, EXPR inv(a) [L58] r = inv(a) [L60] CALL __VERIFIER_assert(r >= 0 && r <= 0.06) [L23] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L23] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 23 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-02 20:53:07,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67155ca1e686450fca2a6f4b9f638c838555b88a3546adff9656d040c859ca12 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:53:10,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:53:10,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:53:10,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:53:10,214 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:53:10,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:53:10,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:53:10,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:53:10,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:53:10,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:53:10,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:53:10,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:53:10,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:53:10,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:53:10,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:53:10,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:53:10,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:53:10,251 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:53:10,253 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:53:10,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:53:10,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:53:10,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:53:10,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:53:10,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:53:10,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:53:10,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:53:10,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:53:10,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:53:10,268 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:53:10,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:53:10,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:53:10,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:53:10,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:53:10,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:53:10,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:53:10,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:53:10,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:53:10,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:53:10,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:53:10,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:53:10,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:53:10,278 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-02 20:53:10,321 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:53:10,321 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:53:10,323 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:53:10,323 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:53:10,324 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:53:10,324 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:53:10,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:53:10,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:53:10,326 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:53:10,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:53:10,327 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:53:10,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:53:10,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:53:10,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:53:10,329 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:53:10,329 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:53:10,329 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:53:10,329 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-02 20:53:10,329 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-02 20:53:10,330 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:53:10,330 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:53:10,330 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:53:10,330 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:53:10,331 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:53:10,331 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:53:10,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:53:10,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:10,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:53:10,332 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:53:10,332 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:53:10,332 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-02 20:53:10,333 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-02 20:53:10,333 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:53:10,333 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:53:10,334 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:53:10,334 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-02 20:53:10,334 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/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_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 67155ca1e686450fca2a6f4b9f638c838555b88a3546adff9656d040c859ca12 [2022-11-02 20:53:10,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:53:10,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:53:10,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:53:10,779 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:53:10,783 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:53:10,785 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/float-benchs/inv_Newton-2.c [2022-11-02 20:53:10,862 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/data/a2d584554/1f2b5140af1f428ebd30c0ef6c7358fe/FLAG4ca9f6e4c [2022-11-02 20:53:11,456 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:53:11,457 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/sv-benchmarks/c/float-benchs/inv_Newton-2.c [2022-11-02 20:53:11,465 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/data/a2d584554/1f2b5140af1f428ebd30c0ef6c7358fe/FLAG4ca9f6e4c [2022-11-02 20:53:11,805 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/data/a2d584554/1f2b5140af1f428ebd30c0ef6c7358fe [2022-11-02 20:53:11,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:53:11,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:53:11,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:11,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:53:11,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:53:11,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa6919c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:11, skipping insertion in model container [2022-11-02 20:53:11,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:11" (1/1) ... [2022-11-02 20:53:11,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:53:11,851 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:53:12,007 WARN L230 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_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/sv-benchmarks/c/float-benchs/inv_Newton-2.c[847,860] [2022-11-02 20:53:12,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:12,040 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:53:12,101 WARN L230 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_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/sv-benchmarks/c/float-benchs/inv_Newton-2.c[847,860] [2022-11-02 20:53:12,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:12,134 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:53:12,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:12 WrapperNode [2022-11-02 20:53:12,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:12,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:12,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:53:12,136 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:53:12,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:12" (1/1) ... [2022-11-02 20:53:12,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:12" (1/1) ... [2022-11-02 20:53:12,171 INFO L138 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2022-11-02 20:53:12,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:12,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:53:12,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:53:12,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:53:12,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:12" (1/1) ... [2022-11-02 20:53:12,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:12" (1/1) ... [2022-11-02 20:53:12,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:12" (1/1) ... [2022-11-02 20:53:12,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:12" (1/1) ... [2022-11-02 20:53:12,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:12" (1/1) ... [2022-11-02 20:53:12,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:12" (1/1) ... [2022-11-02 20:53:12,203 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:12" (1/1) ... [2022-11-02 20:53:12,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:12" (1/1) ... [2022-11-02 20:53:12,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:53:12,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:53:12,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:53:12,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:53:12,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:12" (1/1) ... [2022-11-02 20:53:12,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:12,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:12,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:53:12,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:53:12,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:53:12,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-11-02 20:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-11-02 20:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-02 20:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-02 20:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:53:12,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:53:12,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:53:12,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-02 20:53:12,385 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:53:12,388 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:53:14,791 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:53:14,798 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:53:14,798 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:53:14,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:14 BoogieIcfgContainer [2022-11-02 20:53:14,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:53:14,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:53:14,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:53:14,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:53:14,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:53:11" (1/3) ... [2022-11-02 20:53:14,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4456d341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:53:14, skipping insertion in model container [2022-11-02 20:53:14,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:12" (2/3) ... [2022-11-02 20:53:14,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4456d341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:53:14, skipping insertion in model container [2022-11-02 20:53:14,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:14" (3/3) ... [2022-11-02 20:53:14,816 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_Newton-2.c [2022-11-02 20:53:14,838 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:53:14,838 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:53:14,884 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:53:14,892 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=LoopsAndPotentialCycles, 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;@544d173d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:53:14,892 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:53:14,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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) [2022-11-02 20:53:14,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:53:14,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:14,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:14,904 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:14,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:14,910 INFO L85 PathProgramCache]: Analyzing trace with hash -590190995, now seen corresponding path program 1 times [2022-11-02 20:53:14,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:53:14,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88741842] [2022-11-02 20:53:14,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:14,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:53:14,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:53:14,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:53:14,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-02 20:53:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-02 20:53:15,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:15,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:53:15,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:53:15,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88741842] [2022-11-02 20:53:15,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88741842] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:15,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:15,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:15,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453880946] [2022-11-02 20:53:15,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:15,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:53:15,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:53:15,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:53:15,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:53:15,235 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:15,268 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-11-02 20:53:15,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:53:15,270 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:53:15,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:15,278 INFO L225 Difference]: With dead ends: 25 [2022-11-02 20:53:15,278 INFO L226 Difference]: Without dead ends: 10 [2022-11-02 20:53:15,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:53:15,285 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:15,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:53:15,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-02 20:53:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-11-02 20:53:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-11-02 20:53:15,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2022-11-02 20:53:15,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:15,319 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-11-02 20:53:15,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:15,320 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-11-02 20:53:15,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:53:15,320 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:15,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:15,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:15,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:53:15,535 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:15,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:15,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1184816367, now seen corresponding path program 1 times [2022-11-02 20:53:15,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:53:15,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823265797] [2022-11-02 20:53:15,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:15,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:53:15,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:53:15,539 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:53:15,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-02 20:53:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:53:15,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:15,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:15,755 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:53:15,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:53:15,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823265797] [2022-11-02 20:53:15,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823265797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:15,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:15,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:53:15,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201796667] [2022-11-02 20:53:15,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:15,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:15,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:53:15,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:15,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:15,766 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:17,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-02 20:53:18,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:18,100 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-11-02 20:53:18,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:18,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:53:18,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:18,101 INFO L225 Difference]: With dead ends: 16 [2022-11-02 20:53:18,101 INFO L226 Difference]: Without dead ends: 11 [2022-11-02 20:53:18,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:18,104 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:18,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 20:53:18,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-02 20:53:18,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-11-02 20:53:18,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-11-02 20:53:18,110 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-11-02 20:53:18,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:18,111 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-11-02 20:53:18,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:18,111 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-11-02 20:53:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:53:18,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:18,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:18,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:18,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 20:53:18,326 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:18,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:18,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1873743609, now seen corresponding path program 1 times [2022-11-02 20:53:18,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 20:53:18,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395822613] [2022-11-02 20:53:18,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:18,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 20:53:18,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 20:53:18,329 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 20:53:18,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fe4ef1a-aed6-454d-ad0c-e8e7620b6edf/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-02 20:53:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:19,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-02 20:53:19,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:39,423 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (let ((.cse6 (fp.neg .cse5)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (or (and (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv0 32)) (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse4 (let ((.cse8 (let ((.cse9 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse8) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse8)) .cse8)))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) .cse0) (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse3) (not (fp.gt .cse4 .cse5)) (not (fp.lt .cse4 .cse6))))))) (and (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse10 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse10 .cse2) (fp.leq .cse10 .cse3) (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) .cse0) (fp.lt (let ((.cse11 (let ((.cse12 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse11) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 .cse11) .cse11)) .cse11)) .cse6)))))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse13 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse13 .cse2) (fp.leq .cse13 .cse3) (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) .cse0) (fp.gt (let ((.cse14 (let ((.cse15 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse15) ((_ extract 62 52) .cse15) ((_ extract 51 0) .cse15))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse14) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse14) .cse14)) .cse14)) .cse5))))))) (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv1 32)))))) is different from false [2022-11-02 20:55:05,184 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse3) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse3) .cse3)) .cse3))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (not (fp.gt .cse1 .cse2)) (not (fp.lt .cse1 (fp.neg .cse2))))))) is different from false [2022-11-02 20:55:07,251 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse3) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse3) .cse3)) .cse3))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)) (not (fp.gt .cse1 .cse2)) (not (fp.lt .cse1 (fp.neg .cse2))))))) is different from true [2022-11-02 20:56:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-02 20:56:18,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:56:29,799 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)) |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1))) is different from false [2022-11-02 20:56:31,932 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)) |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1))) is different from true [2022-11-02 20:56:52,264 WARN L855 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) .cse3))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse2)) (fp.gt .cse0 .cse1) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))))) is different from true [2022-11-02 20:57:12,039 WARN L855 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) .cse3))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse2)) (fp.gt .cse0 .cse1) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))))))))) is different from true [2022-11-02 20:57:36,450 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) .cse3))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (not (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (not (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (fp.gt .cse0 .cse1) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))))) is different from false [2022-11-02 20:57:38,597 WARN L855 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) .cse3))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (not (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (not (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (fp.gt .cse0 .cse1) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))))) is different from true [2022-11-02 20:57:38,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-02 20:57:38,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 20:57:38,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395822613] [2022-11-02 20:57:38,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395822613] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:57:38,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:57:38,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2022-11-02 20:57:38,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239698583] [2022-11-02 20:57:38,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:38,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:57:38,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 20:57:38,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:57:38,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=31, Unknown=9, NotChecked=90, Total=156 [2022-11-02 20:57:38,603 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 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) [2022-11-02 20:57:40,733 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) .cse3))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (not (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (not (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (fp.gt .cse0 .cse1) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-02 20:57:42,882 WARN L855 $PredicateComparison]: unable to prove that (and (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) .cse3))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (not (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 30.0))) (not (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (fp.gt .cse0 .cse1) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-02 20:57:45,078 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (or .cse0 (forall ((v_skolemized_v_prenex_1_6 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (let ((.cse1 (let ((.cse4 (let ((.cse5 (concat ((_ extract 63 32) v_skolemized_v_prenex_1_6) (bvshl (bvadd (_ bv1023 32) (bvneg (bvadd (bvashr (bvand ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)))) (_ bv20 32))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse4) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse4) .cse4)) .cse4))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse1 (fp.neg .cse2)) (not (= |c_ULTIMATE.start_main_~a~0#1| .cse3)) (fp.gt .cse1 .cse2) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_6) ((_ extract 62 52) v_skolemized_v_prenex_1_6) ((_ extract 51 0) v_skolemized_v_prenex_1_6)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))))))))) (let ((.cse7 (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (.cse6 (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 30.0)))) (or (and .cse6 .cse7 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (or (not .cse7) (not .cse6)) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true