./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4582c3eb38d182065b024eaa1ecbc8cf3ce1cd8f100c8eebac06484d412900d6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:37:09,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:37:10,035 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-23 23:37:10,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:37:10,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:37:10,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:37:10,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:37:10,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:37:10,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:37:10,072 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:37:10,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:37:10,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:37:10,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:37:10,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:37:10,073 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:37:10,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:37:10,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 23:37:10,074 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:37:10,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:37:10,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:37:10,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:37:10,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 23:37:10,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:37:10,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 23:37:10,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:37:10,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 23:37:10,076 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:37:10,076 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:37:10,076 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:37:10,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:37:10,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:37:10,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:37:10,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:37:10,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:37:10,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:37:10,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:37:10,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:37:10,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:37:10,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:37:10,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:37:10,078 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 23:37:10,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 23:37:10,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 23:37:10,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 23:37:10,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:37:10,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:37:10,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:37:10,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:37:10,079 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4582c3eb38d182065b024eaa1ecbc8cf3ce1cd8f100c8eebac06484d412900d6 [2024-11-23 23:37:10,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:37:10,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:37:10,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:37:10,419 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:37:10,420 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:37:10,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2024-11-23 23:37:13,661 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/data/edab7aff0/0cc024fe0adf4c7b9eb52c91922bd715/FLAGae0c08a0a [2024-11-23 23:37:13,974 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:37:13,974 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2024-11-23 23:37:13,985 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/data/edab7aff0/0cc024fe0adf4c7b9eb52c91922bd715/FLAGae0c08a0a [2024-11-23 23:37:14,020 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/data/edab7aff0/0cc024fe0adf4c7b9eb52c91922bd715 [2024-11-23 23:37:14,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:37:14,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:37:14,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:37:14,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:37:14,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:37:14,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:37:14" (1/1) ... [2024-11-23 23:37:14,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b6c38b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:14, skipping insertion in model container [2024-11-23 23:37:14,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:37:14" (1/1) ... [2024-11-23 23:37:14,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:37:14,252 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c[699,712] [2024-11-23 23:37:14,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:37:14,275 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:37:14,291 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c[699,712] [2024-11-23 23:37:14,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:37:14,311 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:37:14,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:14 WrapperNode [2024-11-23 23:37:14,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:37:14,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:37:14,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:37:14,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:37:14,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:14" (1/1) ... [2024-11-23 23:37:14,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:14" (1/1) ... [2024-11-23 23:37:14,356 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28 [2024-11-23 23:37:14,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:37:14,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:37:14,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:37:14,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:37:14,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:14" (1/1) ... [2024-11-23 23:37:14,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:14" (1/1) ... [2024-11-23 23:37:14,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:14" (1/1) ... [2024-11-23 23:37:14,385 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-23 23:37:14,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:14" (1/1) ... [2024-11-23 23:37:14,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:14" (1/1) ... [2024-11-23 23:37:14,391 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:14" (1/1) ... [2024-11-23 23:37:14,396 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:14" (1/1) ... [2024-11-23 23:37:14,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:14" (1/1) ... [2024-11-23 23:37:14,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:14" (1/1) ... [2024-11-23 23:37:14,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:14" (1/1) ... [2024-11-23 23:37:14,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:37:14,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:37:14,406 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:37:14,406 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:37:14,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:14" (1/1) ... [2024-11-23 23:37:14,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:37:14,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:37:14,460 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 23:37:14,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 23:37:14,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:37:14,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:37:14,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:37:14,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 23:37:14,570 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:37:14,572 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:37:14,683 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-23 23:37:14,683 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:37:14,693 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:37:14,694 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-23 23:37:14,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:37:14 BoogieIcfgContainer [2024-11-23 23:37:14,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:37:14,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:37:14,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:37:14,704 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:37:14,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:37:14" (1/3) ... [2024-11-23 23:37:14,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65412017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:37:14, skipping insertion in model container [2024-11-23 23:37:14,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:14" (2/3) ... [2024-11-23 23:37:14,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65412017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:37:14, skipping insertion in model container [2024-11-23 23:37:14,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:37:14" (3/3) ... [2024-11-23 23:37:14,707 INFO L128 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i.p+cfa-reducer.c [2024-11-23 23:37:14,726 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:37:14,728 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Float_div_bad.i.p+cfa-reducer.c that has 1 procedures, 9 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-23 23:37:14,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:37:14,805 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3102b363, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:37:14,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-23 23:37:14,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 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) [2024-11-23 23:37:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-23 23:37:14,816 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:37:14,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-23 23:37:14,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:37:14,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:37:14,822 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2024-11-23 23:37:14,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:37:14,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589293498] [2024-11-23 23:37:14,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:37:14,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:37:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:37:14,934 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:37:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:37:14,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 23:37:14,981 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 23:37:14,985 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-23 23:37:14,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 23:37:14,997 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 23:37:15,027 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 23:37:15,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:37:15 BoogieIcfgContainer [2024-11-23 23:37:15,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 23:37:15,034 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 23:37:15,034 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 23:37:15,035 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 23:37:15,035 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:37:14" (3/4) ... [2024-11-23 23:37:15,038 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-23 23:37:15,039 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 23:37:15,042 INFO L158 Benchmark]: Toolchain (without parser) took 1015.56ms. Allocated memory is still 117.4MB. Free memory was 93.5MB in the beginning and 58.8MB in the end (delta: 34.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-23 23:37:15,042 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 167.8MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:37:15,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.73ms. Allocated memory is still 117.4MB. Free memory was 93.5MB in the beginning and 82.7MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:37:15,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.72ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 81.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:37:15,046 INFO L158 Benchmark]: Boogie Preprocessor took 47.86ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 80.8MB in the end (delta: 751.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:37:15,047 INFO L158 Benchmark]: RCFGBuilder took 288.38ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 71.4MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:37:15,047 INFO L158 Benchmark]: TraceAbstraction took 334.62ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 59.2MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:37:15,047 INFO L158 Benchmark]: Witness Printer took 5.66ms. Allocated memory is still 117.4MB. Free memory is still 58.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:37:15,050 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44ms. Allocated memory is still 167.8MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.73ms. Allocated memory is still 117.4MB. Free memory was 93.5MB in the beginning and 82.7MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.72ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 81.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.86ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 80.8MB in the end (delta: 751.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 288.38ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 71.4MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 334.62ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 59.2MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Witness Printer took 5.66ms. Allocated memory is still 117.4MB. Free memory is still 58.8MB. 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: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 10, overapproximation of someBinaryFLOATComparisonOperation at line 12. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] float main__x = 1.0; [L10] float main__x1 = main__x / 1.600000023841858; VAL [__return_main=0] [L12] COND FALSE !(main__x1 != main__x) [L21] int __tmp_1; [L22] __tmp_1 = main__x == 0 [L23] int __VERIFIER_assert__cond; [L24] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_main=0] [L25] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0] [L27] reach_error() VAL [__return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-23 23:37:15,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4582c3eb38d182065b024eaa1ecbc8cf3ce1cd8f100c8eebac06484d412900d6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:37:18,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:37:18,226 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-23 23:37:18,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:37:18,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:37:18,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:37:18,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:37:18,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:37:18,284 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:37:18,284 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:37:18,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:37:18,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:37:18,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:37:18,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:37:18,285 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:37:18,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:37:18,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 23:37:18,286 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:37:18,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:37:18,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:37:18,286 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 23:37:18,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:37:18,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 23:37:18,287 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-23 23:37:18,287 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-23 23:37:18,287 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-23 23:37:18,287 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:37:18,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 23:37:18,287 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:37:18,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:37:18,287 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:37:18,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:37:18,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:37:18,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:37:18,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:37:18,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:37:18,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:37:18,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:37:18,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:37:18,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:37:18,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:37:18,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:37:18,290 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 23:37:18,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 23:37:18,291 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-23 23:37:18,291 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-23 23:37:18,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:37:18,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:37:18,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:37:18,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:37:18,292 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4582c3eb38d182065b024eaa1ecbc8cf3ce1cd8f100c8eebac06484d412900d6 [2024-11-23 23:37:18,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:37:18,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:37:18,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:37:18,734 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:37:18,734 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:37:18,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2024-11-23 23:37:21,828 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/data/85c696423/aa34c026e69a4c08ae71b2d7c16f195a/FLAGb82c2d745 [2024-11-23 23:37:22,065 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:37:22,066 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2024-11-23 23:37:22,076 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/data/85c696423/aa34c026e69a4c08ae71b2d7c16f195a/FLAGb82c2d745 [2024-11-23 23:37:22,104 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/data/85c696423/aa34c026e69a4c08ae71b2d7c16f195a [2024-11-23 23:37:22,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:37:22,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:37:22,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:37:22,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:37:22,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:37:22,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:37:22" (1/1) ... [2024-11-23 23:37:22,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c272c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:22, skipping insertion in model container [2024-11-23 23:37:22,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:37:22" (1/1) ... [2024-11-23 23:37:22,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:37:22,377 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c[699,712] [2024-11-23 23:37:22,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:37:22,408 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:37:22,429 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c[699,712] [2024-11-23 23:37:22,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:37:22,455 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:37:22,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:22 WrapperNode [2024-11-23 23:37:22,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:37:22,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:37:22,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:37:22,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:37:22,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:22" (1/1) ... [2024-11-23 23:37:22,480 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:22" (1/1) ... [2024-11-23 23:37:22,501 INFO L138 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2024-11-23 23:37:22,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:37:22,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:37:22,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:37:22,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:37:22,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:22" (1/1) ... [2024-11-23 23:37:22,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:22" (1/1) ... [2024-11-23 23:37:22,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:22" (1/1) ... [2024-11-23 23:37:22,531 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-23 23:37:22,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:22" (1/1) ... [2024-11-23 23:37:22,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:22" (1/1) ... [2024-11-23 23:37:22,544 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:22" (1/1) ... [2024-11-23 23:37:22,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:22" (1/1) ... [2024-11-23 23:37:22,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:22" (1/1) ... [2024-11-23 23:37:22,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:22" (1/1) ... [2024-11-23 23:37:22,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:22" (1/1) ... [2024-11-23 23:37:22,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:37:22,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:37:22,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:37:22,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:37:22,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:22" (1/1) ... [2024-11-23 23:37:22,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:37:22,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:37:22,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 23:37:22,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 23:37:22,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:37:22,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:37:22,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:37:22,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-23 23:37:22,724 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:37:22,726 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:37:31,106 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-23 23:37:31,106 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:37:31,118 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:37:31,118 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-23 23:37:31,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:37:31 BoogieIcfgContainer [2024-11-23 23:37:31,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:37:31,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:37:31,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:37:31,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:37:31,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:37:22" (1/3) ... [2024-11-23 23:37:31,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8fca2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:37:31, skipping insertion in model container [2024-11-23 23:37:31,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:22" (2/3) ... [2024-11-23 23:37:31,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8fca2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:37:31, skipping insertion in model container [2024-11-23 23:37:31,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:37:31" (3/3) ... [2024-11-23 23:37:31,133 INFO L128 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i.p+cfa-reducer.c [2024-11-23 23:37:31,154 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:37:31,156 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Float_div_bad.i.p+cfa-reducer.c that has 1 procedures, 9 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-23 23:37:31,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:37:31,236 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@759fe380, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:37:31,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-23 23:37:31,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 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) [2024-11-23 23:37:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-23 23:37:31,250 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:37:31,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-23 23:37:31,251 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:37:31,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:37:31,258 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2024-11-23 23:37:31,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:37:31,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338965251] [2024-11-23 23:37:31,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:37:31,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 23:37:31,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 23:37:31,278 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 23:37:31,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-23 23:37:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:37:32,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 23:37:32,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:37:38,604 WARN L286 SmtUtils]: Spent 6.21s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:37:47,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:37:47,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:37:47,878 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:37:47,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338965251] [2024-11-23 23:37:47,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338965251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:37:47,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:37:47,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:37:47,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800264851] [2024-11-23 23:37:47,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:37:47,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:37:47,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:37:47,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:37:47,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=6, Unknown=1, NotChecked=0, Total=12 [2024-11-23 23:37:47,915 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:37:52,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:38:03,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:38:07,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:38:11,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:38:15,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:38:20,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:38:22,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:38:24,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:38:28,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:38:32,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:38:36,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:38:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:38:36,404 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-11-23 23:38:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:38:36,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-23 23:38:36,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:38:36,478 INFO L225 Difference]: With dead ends: 16 [2024-11-23 23:38:36,483 INFO L226 Difference]: Without dead ends: 7 [2024-11-23 23:38:36,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2024-11-23 23:38:36,491 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.2s IncrementalHoareTripleChecker+Time [2024-11-23 23:38:36,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 7 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 9 Unknown, 0 Unchecked, 41.2s Time] [2024-11-23 23:38:36,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2024-11-23 23:38:36,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-11-23 23:38:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:38:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2024-11-23 23:38:36,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2024-11-23 23:38:36,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:38:36,525 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2024-11-23 23:38:36,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:38:36,526 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2024-11-23 23:38:36,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-23 23:38:36,526 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:38:36,526 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-23 23:38:36,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-23 23:38:36,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 23:38:36,727 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:38:36,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:38:36,728 INFO L85 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2024-11-23 23:38:36,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:38:36,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620930252] [2024-11-23 23:38:36,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:38:36,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 23:38:36,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 23:38:36,730 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 23:38:36,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-23 23:38:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:38:38,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 23:38:38,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:38:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-23 23:38:57,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:39:08,506 WARN L286 SmtUtils]: Spent 7.19s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:39:12,577 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) is different from false [2024-11-23 23:39:16,660 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) is different from true [2024-11-23 23:39:24,937 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:39:29,070 WARN L851 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2024-11-23 23:39:33,199 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2024-11-23 23:39:33,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-23 23:39:33,200 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:39:33,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620930252] [2024-11-23 23:39:33,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [620930252] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:39:33,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:39:33,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-23 23:39:33,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413948486] [2024-11-23 23:39:33,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:39:33,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 23:39:33,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:39:33,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 23:39:33,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=19, Unknown=4, NotChecked=18, Total=56 [2024-11-23 23:39:33,202 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 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) [2024-11-23 23:39:37,357 WARN L873 $PredicateComparison]: unable to prove that (and (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-23 23:39:44,264 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-23 23:39:48,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:39:52,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:39:56,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:40:00,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:40:04,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:40:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:40:05,545 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2024-11-23 23:40:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 23:40:05,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-23 23:40:05,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:40:05,547 INFO L225 Difference]: With dead ends: 11 [2024-11-23 23:40:05,547 INFO L226 Difference]: Without dead ends: 8 [2024-11-23 23:40:05,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 45.5s TimeCoverageRelationStatistics Valid=19, Invalid=21, Unknown=6, NotChecked=44, Total=90 [2024-11-23 23:40:05,548 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:40:05,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 5 Unknown, 21 Unchecked, 21.3s Time] [2024-11-23 23:40:05,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-11-23 23:40:05,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-11-23 23:40:05,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:40:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-11-23 23:40:05,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2024-11-23 23:40:05,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:40:05,552 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-11-23 23:40:05,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 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) [2024-11-23 23:40:05,552 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-11-23 23:40:05,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-23 23:40:05,552 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:40:05,553 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-23 23:40:05,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-23 23:40:05,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 23:40:05,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:40:05,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:40:05,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1805796550, now seen corresponding path program 2 times [2024-11-23 23:40:05,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:40:05,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750727791] [2024-11-23 23:40:05,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:40:05,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 23:40:05,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 23:40:05,756 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 23:40:05,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-23 23:40:08,085 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 23:40:08,086 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:40:08,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-23 23:40:08,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:40:20,887 WARN L286 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:40:25,035 WARN L873 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-23 23:40:32,776 WARN L286 SmtUtils]: Spent 7.74s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:40:41,874 WARN L286 SmtUtils]: Spent 9.07s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:40:48,867 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-23 23:40:48,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-23 23:40:48,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:41:02,436 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:41:06,544 WARN L851 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from false [2024-11-23 23:41:10,638 WARN L873 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from true [2024-11-23 23:41:19,318 WARN L286 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:41:27,866 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:41:32,050 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-23 23:41:36,243 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-23 23:41:45,176 WARN L286 SmtUtils]: Spent 8.93s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:41:53,911 WARN L286 SmtUtils]: Spent 8.73s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:41:58,154 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-23 23:42:02,405 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-23 23:42:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-23 23:42:02,405 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:42:02,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750727791] [2024-11-23 23:42:02,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750727791] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:42:02,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:42:02,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2024-11-23 23:42:02,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972808092] [2024-11-23 23:42:02,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:42:02,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-23 23:42:02,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:42:02,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-23 23:42:02,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=8, NotChecked=60, Total=110 [2024-11-23 23:42:02,407 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:42:06,714 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-23 23:42:10,814 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-23 23:42:15,042 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-23 23:42:19,093 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-23 23:42:23,309 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-23 23:42:30,146 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (or (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-23 23:42:34,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:42:38,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:42:40,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:42:40,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:42:40,891 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2024-11-23 23:42:40,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:42:40,892 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-23 23:42:40,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:42:40,892 INFO L225 Difference]: With dead ends: 12 [2024-11-23 23:42:40,892 INFO L226 Difference]: Without dead ends: 9 [2024-11-23 23:42:40,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 67.8s TimeCoverageRelationStatistics Valid=28, Invalid=24, Unknown=14, NotChecked=144, Total=210 [2024-11-23 23:42:40,894 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2024-11-23 23:42:40,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 2 Unknown, 58 Unchecked, 10.8s Time] [2024-11-23 23:42:40,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-23 23:42:40,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-23 23:42:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:42:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-23 23:42:40,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2024-11-23 23:42:40,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:42:40,897 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-23 23:42:40,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:42:40,898 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-23 23:42:40,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-23 23:42:40,898 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:42:40,898 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2024-11-23 23:42:40,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-23 23:42:41,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 23:42:41,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:42:41,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:42:41,100 INFO L85 PathProgramCache]: Analyzing trace with hash 145055718, now seen corresponding path program 3 times [2024-11-23 23:42:41,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:42:41,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535022019] [2024-11-23 23:42:41,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 23:42:41,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 23:42:41,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 23:42:41,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 23:42:41,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-23 23:42:44,986 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-23 23:42:44,987 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:42:45,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-23 23:42:45,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:42:56,568 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:43:00,743 WARN L873 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-23 23:43:09,630 WARN L286 SmtUtils]: Spent 8.82s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:43:13,908 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-23 23:43:22,091 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:43:31,917 WARN L286 SmtUtils]: Spent 9.78s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:43:38,659 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-23 23:43:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-23 23:43:38,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:43:44,550 WARN L286 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:43:52,754 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:44:00,399 WARN L873 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from true [2024-11-23 23:44:09,081 WARN L286 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:44:17,664 WARN L286 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:44:21,899 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-23 23:44:26,069 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-23 23:44:35,073 WARN L286 SmtUtils]: Spent 9.00s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:44:43,947 WARN L286 SmtUtils]: Spent 8.87s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:44:48,256 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from false [2024-11-23 23:44:52,547 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2024-11-23 23:45:02,227 WARN L286 SmtUtils]: Spent 9.68s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:45:11,323 WARN L286 SmtUtils]: Spent 9.10s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:45:15,702 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-23 23:45:20,074 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-23 23:45:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-23 23:45:20,076 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:45:20,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535022019] [2024-11-23 23:45:20,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535022019] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:45:20,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:45:20,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-11-23 23:45:20,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190449681] [2024-11-23 23:45:20,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:45:20,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-23 23:45:20,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:45:20,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-23 23:45:20,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=24, Unknown=10, NotChecked=98, Total=156 [2024-11-23 23:45:20,079 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:45:24,600 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-23 23:45:28,768 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0))) .cse0)))) (or (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-23 23:45:33,155 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0))) .cse0)))) (or (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-23 23:45:37,274 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-23 23:45:41,739 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-23 23:45:46,154 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-23 23:45:50,209 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (or (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-23 23:45:54,535 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (or (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-23 23:45:58,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:46:02,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:46:06,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:46:08,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:46:09,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:46:09,048 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-11-23 23:46:09,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 23:46:09,049 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-23 23:46:09,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:46:09,049 INFO L225 Difference]: With dead ends: 13 [2024-11-23 23:46:09,049 INFO L226 Difference]: Without dead ends: 10 [2024-11-23 23:46:09,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 85.6s TimeCoverageRelationStatistics Valid=34, Invalid=26, Unknown=18, NotChecked=228, Total=306 [2024-11-23 23:46:09,051 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2024-11-23 23:46:09,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 3 Unknown, 86 Unchecked, 14.6s Time] [2024-11-23 23:46:09,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-23 23:46:09,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-23 23:46:09,069 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) [2024-11-23 23:46:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-23 23:46:09,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2024-11-23 23:46:09,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:46:09,070 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-23 23:46:09,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:46:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-23 23:46:09,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-23 23:46:09,071 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:46:09,071 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2024-11-23 23:46:09,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-23 23:46:09,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 23:46:09,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:46:09,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:46:09,273 INFO L85 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 4 times [2024-11-23 23:46:09,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:46:09,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867194544] [2024-11-23 23:46:09,274 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-23 23:46:09,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 23:46:09,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 23:46:09,276 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 23:46:09,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-23 23:46:13,328 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-23 23:46:13,328 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:46:13,460 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-23 23:46:13,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:46:31,966 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:46:36,117 WARN L851 $PredicateComparison]: unable to prove that (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) |c_ULTIMATE.start_main_~main__x1~0#1|) is different from false [2024-11-23 23:46:40,272 WARN L873 $PredicateComparison]: unable to prove that (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) |c_ULTIMATE.start_main_~main__x1~0#1|) is different from true [2024-11-23 23:46:48,862 WARN L286 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:46:53,195 WARN L851 $PredicateComparison]: unable to prove that (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0)))) is different from false [2024-11-23 23:46:57,506 WARN L873 $PredicateComparison]: unable to prove that (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0)))) is different from true [2024-11-23 23:47:06,523 WARN L286 SmtUtils]: Spent 9.02s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:47:10,934 WARN L851 $PredicateComparison]: unable to prove that (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) |c_ULTIMATE.start_main_~main__x1~0#1|) is different from false [2024-11-23 23:47:15,341 WARN L873 $PredicateComparison]: unable to prove that (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) |c_ULTIMATE.start_main_~main__x1~0#1|) is different from true [2024-11-23 23:47:25,165 WARN L286 SmtUtils]: Spent 9.81s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:47:34,317 WARN L286 SmtUtils]: Spent 9.15s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:47:38,828 WARN L851 $PredicateComparison]: unable to prove that (exists ((currentRoundingMode RoundingMode)) (let ((.cse0 ((_ to_fp 11 53) currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (= ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|)))) is different from false [2024-11-23 23:47:43,092 WARN L873 $PredicateComparison]: unable to prove that (exists ((currentRoundingMode RoundingMode)) (let ((.cse0 ((_ to_fp 11 53) currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (= ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|)))) is different from true [2024-11-23 23:47:56,862 WARN L286 SmtUtils]: Spent 9.13s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:48:01,458 WARN L851 $PredicateComparison]: unable to prove that (exists ((currentRoundingMode RoundingMode)) (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2024-11-23 23:48:05,830 WARN L873 $PredicateComparison]: unable to prove that (exists ((currentRoundingMode RoundingMode)) (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2024-11-23 23:48:19,432 WARN L286 SmtUtils]: Spent 9.10s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:48:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-23 23:48:19,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:48:33,061 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:48:37,184 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) is different from false [2024-11-23 23:48:41,301 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) is different from true [2024-11-23 23:48:49,822 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:48:54,063 WARN L851 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2024-11-23 23:48:58,293 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2024-11-23 23:49:06,935 WARN L286 SmtUtils]: Spent 8.64s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:49:11,218 WARN L851 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2024-11-23 23:49:15,567 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2024-11-23 23:49:24,410 WARN L286 SmtUtils]: Spent 8.84s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:49:28,871 WARN L851 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2024-11-23 23:49:33,289 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2024-11-23 23:49:46,986 WARN L286 SmtUtils]: Spent 9.11s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:49:51,345 WARN L851 $PredicateComparison]: unable to prove that (forall ((currentRoundingMode RoundingMode)) (not (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode .cse0) .cse1)) .cse0))))) is different from false [2024-11-23 23:49:55,862 WARN L873 $PredicateComparison]: unable to prove that (forall ((currentRoundingMode RoundingMode)) (not (let ((.cse1 ((_ to_fp 11 53) currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2024-11-23 23:49:55,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2024-11-23 23:49:55,863 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:49:55,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867194544] [2024-11-23 23:49:55,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867194544] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:49:55,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:49:55,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2024-11-23 23:49:55,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044065183] [2024-11-23 23:49:55,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:49:55,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-23 23:49:55,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:49:55,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-23 23:49:55,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=7, Unknown=20, NotChecked=130, Total=182 [2024-11-23 23:49:55,864 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:50:00,370 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from false [2024-11-23 23:50:04,789 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from true [2024-11-23 23:50:09,276 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from false [2024-11-23 23:50:13,748 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from true [2024-11-23 23:50:18,250 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))))) is different from false [2024-11-23 23:50:22,727 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))))) is different from true [2024-11-23 23:50:27,260 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|)) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|))) is different from false [2024-11-23 23:50:31,875 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|)) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|))) is different from true [2024-11-23 23:50:36,402 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((currentRoundingMode RoundingMode)) (let ((.cse0 ((_ to_fp 11 53) currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (= ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|)))) (not (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|))) is different from false [2024-11-23 23:50:41,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:50:46,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:50:48,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:50:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:50:49,042 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-23 23:50:49,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 23:50:49,044 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-23 23:50:49,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:50:49,044 INFO L225 Difference]: With dead ends: 14 [2024-11-23 23:50:49,044 INFO L226 Difference]: Without dead ends: 11 [2024-11-23 23:50:49,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 140.8s TimeCoverageRelationStatistics Valid=35, Invalid=8, Unknown=29, NotChecked=270, Total=342 [2024-11-23 23:50:49,045 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-11-23 23:50:49,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 2 Unknown, 117 Unchecked, 11.4s Time] [2024-11-23 23:50:49,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-23 23:50:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-23 23:50:49,049 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) [2024-11-23 23:50:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-11-23 23:50:49,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2024-11-23 23:50:49,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:50:49,050 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-11-23 23:50:49,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:50:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-11-23 23:50:49,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-23 23:50:49,051 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:50:49,051 INFO L218 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2024-11-23 23:50:49,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-23 23:50:49,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 23:50:49,252 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:50:49,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:50:49,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1957592038, now seen corresponding path program 5 times [2024-11-23 23:50:49,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:50:49,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213655385] [2024-11-23 23:50:49,253 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-23 23:50:49,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 23:50:49,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 23:50:49,257 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-23 23:50:49,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-23 23:51:00,255 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-23 23:51:00,255 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:51:00,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-23 23:51:00,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:51:13,574 WARN L286 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:51:17,812 WARN L873 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-23 23:51:26,860 WARN L286 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:51:31,212 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-23 23:51:40,895 WARN L286 SmtUtils]: Spent 9.58s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:51:45,347 WARN L873 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-23 23:51:55,455 WARN L286 SmtUtils]: Spent 10.00s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:51:56,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-23 23:51:56,936 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-23 23:51:56,937 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:51:56,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213655385] [2024-11-23 23:51:56,937 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-23 23:51:56,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-23 23:51:57,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-23 23:51:57,138 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:864) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 44 more [2024-11-23 23:51:57,142 INFO L158 Benchmark]: Toolchain (without parser) took 875031.10ms. Allocated memory is still 83.9MB. Free memory was 60.9MB in the beginning and 38.3MB in the end (delta: 22.6MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-11-23 23:51:57,142 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 83.9MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:51:57,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.05ms. Allocated memory is still 83.9MB. Free memory was 60.6MB in the beginning and 49.5MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:51:57,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.14ms. Allocated memory is still 83.9MB. Free memory was 49.5MB in the beginning and 48.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:51:57,144 INFO L158 Benchmark]: Boogie Preprocessor took 56.20ms. Allocated memory is still 83.9MB. Free memory was 48.4MB in the beginning and 47.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:51:57,145 INFO L158 Benchmark]: RCFGBuilder took 8554.96ms. Allocated memory is still 83.9MB. Free memory was 47.0MB in the beginning and 37.9MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:51:57,145 INFO L158 Benchmark]: TraceAbstraction took 866019.47ms. Allocated memory is still 83.9MB. Free memory was 37.3MB in the beginning and 38.3MB in the end (delta: -970.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:51:57,146 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47ms. Allocated memory is still 83.9MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.05ms. Allocated memory is still 83.9MB. Free memory was 60.6MB in the beginning and 49.5MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.14ms. Allocated memory is still 83.9MB. Free memory was 49.5MB in the beginning and 48.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.20ms. Allocated memory is still 83.9MB. Free memory was 48.4MB in the beginning and 47.0MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 8554.96ms. Allocated memory is still 83.9MB. Free memory was 47.0MB in the beginning and 37.9MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 866019.47ms. Allocated memory is still 83.9MB. Free memory was 37.3MB in the beginning and 38.3MB in the end (delta: -970.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_161ed94b-07f7-4816-80e2-c11d76a7d7df/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")