./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Double_div.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_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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 1b976e330e4c054879765a8eb6bc4e652ff9f2eb85e78e14695d7ebb374384cf --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:48:15,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:48:15,740 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-23 23:48:15,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:48:15,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:48:15,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:48:15,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:48:15,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:48:15,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:48:15,780 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:48:15,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:48:15,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:48:15,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:48:15,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:48:15,781 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:48:15,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:48:15,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 23:48:15,782 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:48:15,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:48:15,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:48:15,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:48:15,783 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 23:48:15,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:48:15,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 23:48:15,783 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:48:15,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 23:48:15,783 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:48:15,783 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:48:15,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:48:15,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:48:15,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:48:15,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:48:15,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:48:15,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:48:15,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:48:15,785 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:48:15,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:48:15,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:48:15,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:48:15,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:48:15,785 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 23:48:15,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 23:48:15,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 23:48:15,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 23:48:15,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:48:15,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:48:15,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:48:15,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:48:15,786 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_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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 -> 1b976e330e4c054879765a8eb6bc4e652ff9f2eb85e78e14695d7ebb374384cf [2024-11-23 23:48:16,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:48:16,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:48:16,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:48:16,097 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:48:16,097 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:48:16,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c [2024-11-23 23:48:19,289 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/data/20f7ddd80/631991261dd9461783b63f8a874640d4/FLAGdcd71827d [2024-11-23 23:48:19,633 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:48:19,634 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c [2024-11-23 23:48:19,643 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/data/20f7ddd80/631991261dd9461783b63f8a874640d4/FLAGdcd71827d [2024-11-23 23:48:19,671 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/data/20f7ddd80/631991261dd9461783b63f8a874640d4 [2024-11-23 23:48:19,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:48:19,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:48:19,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:48:19,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:48:19,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:48:19,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:48:19" (1/1) ... [2024-11-23 23:48:19,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626b61e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:19, skipping insertion in model container [2024-11-23 23:48:19,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:48:19" (1/1) ... [2024-11-23 23:48:19,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:48:19,923 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_6da54cce-464e-4e1c-aace-c8a9d069f0c8/sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c[670,683] [2024-11-23 23:48:19,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:48:19,946 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:48:19,965 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_6da54cce-464e-4e1c-aace-c8a9d069f0c8/sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c[670,683] [2024-11-23 23:48:19,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:48:19,986 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:48:19,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:19 WrapperNode [2024-11-23 23:48:19,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:48:19,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:48:19,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:48:19,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:48:20,007 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:48:19" (1/1) ... [2024-11-23 23:48:20,017 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:48:19" (1/1) ... [2024-11-23 23:48:20,040 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28 [2024-11-23 23:48:20,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:48:20,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:48:20,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:48:20,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:48:20,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:19" (1/1) ... [2024-11-23 23:48:20,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:19" (1/1) ... [2024-11-23 23:48:20,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:19" (1/1) ... [2024-11-23 23:48:20,068 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:48:20,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:19" (1/1) ... [2024-11-23 23:48:20,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:19" (1/1) ... [2024-11-23 23:48:20,073 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:19" (1/1) ... [2024-11-23 23:48:20,077 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:19" (1/1) ... [2024-11-23 23:48:20,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:19" (1/1) ... [2024-11-23 23:48:20,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:19" (1/1) ... [2024-11-23 23:48:20,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:19" (1/1) ... [2024-11-23 23:48:20,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:48:20,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:48:20,086 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:48:20,086 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:48:20,087 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:19" (1/1) ... [2024-11-23 23:48:20,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:48:20,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:48:20,140 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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:48:20,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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:48:20,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:48:20,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:48:20,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:48:20,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 23:48:20,242 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:48:20,244 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:48:20,372 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-23 23:48:20,372 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:48:20,387 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:48:20,387 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-23 23:48:20,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:48:20 BoogieIcfgContainer [2024-11-23 23:48:20,388 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:48:20,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:48:20,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:48:20,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:48:20,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:48:19" (1/3) ... [2024-11-23 23:48:20,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5d3c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:48:20, skipping insertion in model container [2024-11-23 23:48:20,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:19" (2/3) ... [2024-11-23 23:48:20,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5d3c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:48:20, skipping insertion in model container [2024-11-23 23:48:20,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:48:20" (3/3) ... [2024-11-23 23:48:20,402 INFO L128 eAbstractionObserver]: Analyzing ICFG Double_div.i.p+cfa-reducer.c [2024-11-23 23:48:20,422 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:48:20,426 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Double_div.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:48:20,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:48:20,524 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;@75634dea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:48:20,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-23 23:48:20,530 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:48:20,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-23 23:48:20,537 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:48:20,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-23 23:48:20,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:48:20,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:48:20,547 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2024-11-23 23:48:20,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:48:20,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868564938] [2024-11-23 23:48:20,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:20,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:48:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:48:20,665 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 23:48:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 23:48:20,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 23:48:20,703 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 23:48:20,704 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-23 23:48:20,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 23:48:20,712 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-23 23:48:20,735 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 23:48:20,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:48:20 BoogieIcfgContainer [2024-11-23 23:48:20,743 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 23:48:20,744 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 23:48:20,744 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 23:48:20,744 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 23:48:20,747 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:48:20" (3/4) ... [2024-11-23 23:48:20,750 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-23 23:48:20,751 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 23:48:20,753 INFO L158 Benchmark]: Toolchain (without parser) took 1076.32ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 58.4MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-23 23:48:20,755 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:48:20,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.35ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 82.0MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:48:20,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.69ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 80.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:48:20,759 INFO L158 Benchmark]: Boogie Preprocessor took 43.51ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 79.9MB in the end (delta: 987.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:48:20,759 INFO L158 Benchmark]: RCFGBuilder took 301.68ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 71.0MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:48:20,760 INFO L158 Benchmark]: TraceAbstraction took 352.01ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 58.4MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:48:20,760 INFO L158 Benchmark]: Witness Printer took 7.94ms. Allocated memory is still 117.4MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:48:20,763 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.35ms. Allocated memory is still 117.4MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.35ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 82.0MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.69ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 80.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.51ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 79.9MB in the end (delta: 987.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 301.68ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 71.0MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 352.01ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 58.4MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Witness Printer took 7.94ms. Allocated memory is still 117.4MB. Free memory is still 58.4MB. 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 someBinaryDOUBLEComparisonOperation at line 12. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] double main__x = 1.0; [L10] double main__x1 = main__x / 2.5; 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:48:20,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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 1b976e330e4c054879765a8eb6bc4e652ff9f2eb85e78e14695d7ebb374384cf --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:48:24,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:48:24,167 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-23 23:48:24,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:48:24,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:48:24,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:48:24,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:48:24,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:48:24,209 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:48:24,209 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:48:24,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:48:24,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:48:24,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:48:24,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:48:24,213 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:48:24,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:48:24,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 23:48:24,214 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:48:24,214 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:48:24,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:48:24,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 23:48:24,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:48:24,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 23:48:24,214 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-23 23:48:24,214 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-23 23:48:24,214 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-23 23:48:24,214 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:48:24,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 23:48:24,215 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:48:24,215 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:48:24,215 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:48:24,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:48:24,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:48:24,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:48:24,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:48:24,215 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:48:24,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:48:24,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:48:24,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:48:24,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:48:24,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:48:24,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:48:24,216 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 23:48:24,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 23:48:24,216 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-23 23:48:24,216 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-23 23:48:24,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:48:24,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:48:24,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:48:24,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:48:24,217 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_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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 -> 1b976e330e4c054879765a8eb6bc4e652ff9f2eb85e78e14695d7ebb374384cf [2024-11-23 23:48:24,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:48:24,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:48:24,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:48:24,626 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:48:24,627 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:48:24,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c [2024-11-23 23:48:27,807 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/data/7dd3cdc1e/8022f42fc68145c39052ef957577a64c/FLAG3bbc3668f [2024-11-23 23:48:28,116 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:48:28,117 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c [2024-11-23 23:48:28,129 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/data/7dd3cdc1e/8022f42fc68145c39052ef957577a64c/FLAG3bbc3668f [2024-11-23 23:48:28,156 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/data/7dd3cdc1e/8022f42fc68145c39052ef957577a64c [2024-11-23 23:48:28,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:48:28,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:48:28,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:48:28,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:48:28,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:48:28,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:48:28" (1/1) ... [2024-11-23 23:48:28,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1df2114f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:28, skipping insertion in model container [2024-11-23 23:48:28,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:48:28" (1/1) ... [2024-11-23 23:48:28,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:48:28,417 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_6da54cce-464e-4e1c-aace-c8a9d069f0c8/sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c[670,683] [2024-11-23 23:48:28,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:48:28,446 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:48:28,466 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_6da54cce-464e-4e1c-aace-c8a9d069f0c8/sv-benchmarks/c/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c[670,683] [2024-11-23 23:48:28,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:48:28,490 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:48:28,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:28 WrapperNode [2024-11-23 23:48:28,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:48:28,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:48:28,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:48:28,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:48:28,504 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:48:28" (1/1) ... [2024-11-23 23:48:28,514 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:48:28" (1/1) ... [2024-11-23 23:48:28,536 INFO L138 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2024-11-23 23:48:28,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:48:28,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:48:28,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:48:28,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:48:28,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:28" (1/1) ... [2024-11-23 23:48:28,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:28" (1/1) ... [2024-11-23 23:48:28,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:28" (1/1) ... [2024-11-23 23:48:28,570 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:48:28,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:28" (1/1) ... [2024-11-23 23:48:28,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:28" (1/1) ... [2024-11-23 23:48:28,582 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:28" (1/1) ... [2024-11-23 23:48:28,585 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:28" (1/1) ... [2024-11-23 23:48:28,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:28" (1/1) ... [2024-11-23 23:48:28,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:28" (1/1) ... [2024-11-23 23:48:28,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:28" (1/1) ... [2024-11-23 23:48:28,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:48:28,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:48:28,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:48:28,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:48:28,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:28" (1/1) ... [2024-11-23 23:48:28,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:48:28,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:48:28,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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:48:28,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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:48:28,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:48:28,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:48:28,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:48:28,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-23 23:48:28,768 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:48:28,771 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:48:29,946 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-23 23:48:29,947 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:48:29,957 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:48:29,958 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-23 23:48:29,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:48:29 BoogieIcfgContainer [2024-11-23 23:48:29,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:48:29,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:48:29,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:48:29,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:48:29,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:48:28" (1/3) ... [2024-11-23 23:48:29,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd8db5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:48:29, skipping insertion in model container [2024-11-23 23:48:29,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:28" (2/3) ... [2024-11-23 23:48:29,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd8db5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:48:29, skipping insertion in model container [2024-11-23 23:48:29,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:48:29" (3/3) ... [2024-11-23 23:48:29,976 INFO L128 eAbstractionObserver]: Analyzing ICFG Double_div.i.p+cfa-reducer.c [2024-11-23 23:48:29,998 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:48:30,001 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Double_div.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:48:30,078 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:48:30,091 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;@3f6b37c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:48:30,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-23 23:48:30,095 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:48:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-23 23:48:30,101 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:48:30,102 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-23 23:48:30,102 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:48:30,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:48:30,110 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2024-11-23 23:48:30,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:48:30,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579577308] [2024-11-23 23:48:30,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:30,120 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:48:30,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 23:48:30,122 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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:48:30,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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:48:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:30,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 23:48:30,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:48:32,178 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:48:32,178 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:48:32,179 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:48:32,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579577308] [2024-11-23 23:48:32,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579577308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:48:32,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 23:48:32,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 23:48:32,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35601758] [2024-11-23 23:48:32,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:48:32,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 23:48:32,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:48:32,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 23:48:32,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 23:48:32,223 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:48:36,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:48:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:48:36,403 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-11-23 23:48:36,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 23:48:36,419 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:48:36,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:48:36,425 INFO L225 Difference]: With dead ends: 16 [2024-11-23 23:48:36,425 INFO L226 Difference]: Without dead ends: 7 [2024-11-23 23:48:36,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-23 23:48:36,432 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:48:36,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-23 23:48:36,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2024-11-23 23:48:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-11-23 23:48:36,479 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:48:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2024-11-23 23:48:36,485 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2024-11-23 23:48:36,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:48:36,485 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2024-11-23 23:48:36,485 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:48:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2024-11-23 23:48:36,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-23 23:48:36,486 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:48:36,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-23 23:48:36,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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)] Ended with exit code 0 [2024-11-23 23:48:36,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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:48:36,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:48:36,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:48:36,688 INFO L85 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2024-11-23 23:48:36,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:48:36,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724691051] [2024-11-23 23:48:36,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:36,689 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:48:36,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 23:48:36,692 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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:48:36,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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:48:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:37,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 23:48:37,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:48:39,127 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:48:39,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:48:55,778 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:48:55,779 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:48:55,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724691051] [2024-11-23 23:48:55,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724691051] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:48:55,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:48:55,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-23 23:48:55,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764292899] [2024-11-23 23:48:55,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:48:55,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:48:55,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:48:55,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:48:55,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2024-11-23 23:48:55,786 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) 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:48:58,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-23 23:49:13,749 WARN L286 SmtUtils]: Spent 5.77s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-23 23:49:17,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:49:24,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:49:28,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:49:29,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:49:29,511 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2024-11-23 23:49:29,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 23:49:29,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) 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:49:29,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:49:29,535 INFO L225 Difference]: With dead ends: 13 [2024-11-23 23:49:29,535 INFO L226 Difference]: Without dead ends: 10 [2024-11-23 23:49:29,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=41, Invalid=68, Unknown=1, NotChecked=0, Total=110 [2024-11-23 23:49:29,537 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2024-11-23 23:49:29,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 17.5s Time] [2024-11-23 23:49:29,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-23 23:49:29,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-23 23:49:29,540 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:49:29,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-23 23:49:29,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-23 23:49:29,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:49:29,541 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-23 23:49:29,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) 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:49:29,541 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-23 23:49:29,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-23 23:49:29,542 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:49:29,542 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2024-11-23 23:49:29,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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:49:29,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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:49:29,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:49:29,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:49:29,743 INFO L85 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 2 times [2024-11-23 23:49:29,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:49:29,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692226955] [2024-11-23 23:49:29,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 23:49:29,744 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:49:29,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 23:49:29,748 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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:49:29,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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:49:30,603 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 23:49:30,603 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:49:30,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-23 23:49:30,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:49:46,981 WARN L286 SmtUtils]: Spent 8.48s 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:49:51,088 WARN L873 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-23 23:49:59,783 WARN L286 SmtUtils]: Spent 8.67s 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:50:03,943 WARN L873 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div 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:50:13,358 WARN L286 SmtUtils]: Spent 8.71s 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:50:17,460 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|) (= |c_ULTIMATE.start_main_~main__x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-23 23:50:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-23 23:50:17,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:50:32,494 WARN L873 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) |c_ULTIMATE.start_main_~main__x1~0#1|))) is different from true [2024-11-23 23:50:40,756 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:50:49,062 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:50:53,133 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2024-11-23 23:50:57,210 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2024-11-23 23:51:05,642 WARN L286 SmtUtils]: Spent 8.43s 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:51:14,158 WARN L286 SmtUtils]: Spent 8.52s 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:51:18,282 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-23 23:51:22,385 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-23 23:51:31,001 WARN L286 SmtUtils]: Spent 8.61s 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:51:39,498 WARN L286 SmtUtils]: Spent 8.50s 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:51:43,655 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2024-11-23 23:51:47,790 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2024-11-23 23:51:56,622 WARN L286 SmtUtils]: Spent 8.83s 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:52:05,498 WARN L286 SmtUtils]: Spent 8.88s 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:52:09,740 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2024-11-23 23:52:13,992 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2024-11-23 23:52:13,992 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:52:13,993 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:52:13,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692226955] [2024-11-23 23:52:13,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692226955] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:52:13,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:52:13,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-23 23:52:13,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868630567] [2024-11-23 23:52:13,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:52:13,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-23 23:52:13,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:52:13,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-23 23:52:13,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=33, Unknown=12, NotChecked=136, Total=210 [2024-11-23 23:52:13,996 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:52:18,326 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-23 23:52:22,488 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (= |c_ULTIMATE.start_main_~main__x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-23 23:52:26,570 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse0) .cse0))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-23 23:52:31,921 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-23 23:52:36,568 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~main__x1~0#1|) (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div 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:52:56,690 WARN L286 SmtUtils]: Spent 10.86s on a formula simplification. DAG size of input: 23 DAG size of output: 17 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-23 23:52:58,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:53:02,894 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:53:06,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-23 23:53:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:53:06,517 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2024-11-23 23:53:06,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 23:53:06,519 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-23 23:53:06,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:53:06,519 INFO L225 Difference]: With dead ends: 16 [2024-11-23 23:53:06,520 INFO L226 Difference]: Without dead ends: 12 [2024-11-23 23:53:06,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 101.3s TimeCoverageRelationStatistics Valid=52, Invalid=71, Unknown=19, NotChecked=364, Total=506 [2024-11-23 23:53:06,523 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:53:06,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 11 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 1 Unknown, 123 Unchecked, 9.3s Time] [2024-11-23 23:53:06,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-23 23:53:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-23 23:53:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:53:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-23 23:53:06,527 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2024-11-23 23:53:06,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:53:06,528 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-23 23:53:06,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:53:06,528 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-23 23:53:06,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-23 23:53:06,529 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:53:06,529 INFO L218 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2024-11-23 23:53:06,545 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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:53:06,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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:53:06,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:53:06,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:53:06,731 INFO L85 PathProgramCache]: Analyzing trace with hash 555748550, now seen corresponding path program 3 times [2024-11-23 23:53:06,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 23:53:06,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487731448] [2024-11-23 23:53:06,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-23 23:53:06,731 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:53:06,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 23:53:06,736 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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:53:06,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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:53:07,727 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-23 23:53:07,727 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 23:53:07,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-23 23:53:07,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:53:29,933 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:53:38,179 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:53:48,998 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (exists ((|v_ULTIMATE.start_main_~main__x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_17| .cse1))) (and (not (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_17|)) (= |c_ULTIMATE.start_main_~main__x~0#1| .cse0)))) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-23 23:54:05,093 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:54:26,400 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:54:32,432 WARN L286 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:54:40,675 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:54:44,809 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (or (and (= (_ bv1 32) |c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|) (exists ((|v_ULTIMATE.start_main_~main__x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~main__x~0#1_17| .cse2))) (and (fp.eq .cse0 .cse1) (not (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_17|)))))) (and (exists ((|v_ULTIMATE.start_main_~main__x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~main__x~0#1_17| .cse2))) (and (fp.eq (fp.div roundNearestTiesToEven .cse3 .cse2) .cse3) (not (fp.eq .cse3 |v_ULTIMATE.start_main_~main__x~0#1_17|)) (not (fp.eq .cse3 .cse1))))) (= (_ bv0 32) |c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|)))) is different from false [2024-11-23 23:54:57,096 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:55:02,406 WARN L286 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:55:10,635 WARN L286 SmtUtils]: Spent 8.23s 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:55:14,690 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~main__x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~main__x~0#1_17| .cse1))) (and (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0) (not (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_17|)) (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) is different from false [2024-11-23 23:55:18,734 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~main__x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~main__x~0#1_17| .cse1))) (and (fp.eq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse0) (not (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_17|)) (not (fp.eq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) is different from true [2024-11-23 23:55:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 6 not checked. [2024-11-23 23:55:18,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:55:28,724 WARN L286 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:55:40,485 WARN L286 SmtUtils]: Spent 7.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:55:44,695 WARN L873 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)) is different from true [2024-11-23 23:55:52,988 WARN L286 SmtUtils]: Spent 8.29s 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:56:01,196 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:56:09,485 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:56:13,532 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__x~0#1_20| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_20| .cse1))) (or (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_20|) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) is different from false [2024-11-23 23:56:17,601 WARN L873 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__x~0#1_20| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_20| .cse1))) (or (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_20|) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) is different from true [2024-11-23 23:56:22,652 WARN L286 SmtUtils]: Spent 5.05s 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:56:30,843 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:56:39,101 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:56:47,368 WARN L286 SmtUtils]: Spent 8.26s 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:56:55,581 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:57:03,853 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:57:12,119 WARN L286 SmtUtils]: Spent 8.26s 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:57:20,310 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:57:28,555 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:57:36,812 WARN L286 SmtUtils]: Spent 8.25s 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:57:44,998 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:57:53,272 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:58:01,578 WARN L286 SmtUtils]: Spent 8.30s 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:58:09,796 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:58:18,080 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 23:58:18,081 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 11 not checked. [2024-11-23 23:58:18,081 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 23:58:18,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487731448] [2024-11-23 23:58:18,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487731448] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:58:18,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 23:58:18,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-11-23 23:58:18,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778402338] [2024-11-23 23:58:18,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 23:58:18,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-23 23:58:18,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 23:58:18,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-23 23:58:18,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=8, NotChecked=60, Total=110 [2024-11-23 23:58:18,084 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:58:19,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-23 23:58:23,422 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~main__x~0#1_20| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_20| .cse1))) (or (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_20|) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-23 23:58:27,494 WARN L873 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~main__x~0#1_20| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_20| .cse1))) (or (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_20|) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-23 23:58:32,104 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| .cse0) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|) (forall ((|v_ULTIMATE.start_main_~main__x~0#1_20| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_20| .cse1))) (or (fp.eq .cse2 |v_ULTIMATE.start_main_~main__x~0#1_20|) (not (fp.eq (fp.div c_currentRoundingMode .cse2 .cse1) .cse2)) (fp.eq .cse2 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-23 23:58:36,209 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| .cse0) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|) (forall ((|v_ULTIMATE.start_main_~main__x~0#1_20| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_20| .cse1))) (or (fp.eq .cse2 |v_ULTIMATE.start_main_~main__x~0#1_20|) (not (fp.eq (fp.div c_currentRoundingMode .cse2 .cse1) .cse2)) (fp.eq .cse2 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-23 23:58:40,719 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) (.cse2 (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| .cse0) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|)) .cse2) (exists ((|v_ULTIMATE.start_main_~main__x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_17| .cse1))) (and (not (fp.eq .cse3 |v_ULTIMATE.start_main_~main__x~0#1_17|)) (= |c_ULTIMATE.start_main_~main__x~0#1| .cse3)))) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|) (forall ((|v_ULTIMATE.start_main_~main__x~0#1_20| (_ FloatingPoint 11 53))) (let ((.cse4 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_20| .cse1))) (or (fp.eq .cse4 |v_ULTIMATE.start_main_~main__x~0#1_20|) (not (fp.eq (fp.div c_currentRoundingMode .cse4 .cse1) .cse4)) (fp.eq .cse4 .cse0)))) (or (not .cse2) (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-23 23:58:44,819 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))) (.cse2 (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (or (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| .cse0) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|)) .cse2) (exists ((|v_ULTIMATE.start_main_~main__x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_17| .cse1))) (and (not (fp.eq .cse3 |v_ULTIMATE.start_main_~main__x~0#1_17|)) (= |c_ULTIMATE.start_main_~main__x~0#1| .cse3)))) (= (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~main__x~0#1| .cse1) |c_ULTIMATE.start_main_~main__x1~0#1|) (forall ((|v_ULTIMATE.start_main_~main__x~0#1_20| (_ FloatingPoint 11 53))) (let ((.cse4 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~main__x~0#1_20| .cse1))) (or (fp.eq .cse4 |v_ULTIMATE.start_main_~main__x~0#1_20|) (not (fp.eq (fp.div c_currentRoundingMode .cse4 .cse1) .cse4)) (fp.eq .cse4 .cse0)))) (or (not .cse2) (fp.eq |c_ULTIMATE.start_main_~main__x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-23 23:58:48,849 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= (_ bv0 32) |c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|))) (and (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (or (and (= (_ bv1 32) |c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|) (exists ((|v_ULTIMATE.start_main_~main__x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~main__x~0#1_17| .cse2))) (and (fp.eq .cse0 .cse1) (not (fp.eq .cse0 |v_ULTIMATE.start_main_~main__x~0#1_17|)))))) (and (exists ((|v_ULTIMATE.start_main_~main__x~0#1_17| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~main__x~0#1_17| .cse2))) (and (fp.eq (fp.div roundNearestTiesToEven .cse3 .cse2) .cse3) (not (fp.eq .cse3 |v_ULTIMATE.start_main_~main__x~0#1_17|)) (not (fp.eq .cse3 .cse1))))) .cse4))) (not .cse4))) is different from false [2024-11-23 23:58:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:58:48,884 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2024-11-23 23:58:48,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 23:58:48,885 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-23 23:58:48,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:58:48,885 INFO L225 Difference]: With dead ends: 12 [2024-11-23 23:58:48,885 INFO L226 Difference]: Without dead ends: 0 [2024-11-23 23:58:48,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 74.7s TimeCoverageRelationStatistics Valid=28, Invalid=23, Unknown=15, NotChecked=144, Total=210 [2024-11-23 23:58:48,887 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:58:48,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 33 Unchecked, 1.3s Time] [2024-11-23 23:58:48,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-23 23:58:48,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-23 23:58:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:58:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-23 23:58:48,889 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2024-11-23 23:58:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:58:48,889 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-23 23:58:48,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-23 23:58:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-23 23:58:48,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-23 23:58:48,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-23 23:58:48,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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:58:49,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/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:58:49,096 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-23 23:58:49,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-23 23:58:49,104 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 23:58:49,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:58:49 BoogieIcfgContainer [2024-11-23 23:58:49,110 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 23:58:49,111 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 23:58:49,111 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 23:58:49,111 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 23:58:49,112 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:48:29" (3/4) ... [2024-11-23 23:58:49,115 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-23 23:58:49,126 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-23 23:58:49,126 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-23 23:58:49,126 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-23 23:58:49,127 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-23 23:58:49,219 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/witness.graphml [2024-11-23 23:58:49,219 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/witness.yml [2024-11-23 23:58:49,219 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 23:58:49,222 INFO L158 Benchmark]: Toolchain (without parser) took 621057.78ms. Allocated memory is still 83.9MB. Free memory was 60.5MB in the beginning and 42.9MB in the end (delta: 17.7MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-11-23 23:58:49,222 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 83.9MB. Free memory was 64.2MB in the beginning and 64.1MB in the end (delta: 37.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:58:49,223 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.57ms. Allocated memory is still 83.9MB. Free memory was 60.2MB in the beginning and 49.4MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:58:49,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.56ms. Allocated memory is still 83.9MB. Free memory was 49.1MB in the beginning and 48.1MB in the end (delta: 922.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:58:49,224 INFO L158 Benchmark]: Boogie Preprocessor took 59.13ms. Allocated memory is still 83.9MB. Free memory was 48.1MB in the beginning and 46.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:58:49,224 INFO L158 Benchmark]: RCFGBuilder took 1360.77ms. Allocated memory is still 83.9MB. Free memory was 46.6MB in the beginning and 37.6MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 23:58:49,225 INFO L158 Benchmark]: TraceAbstraction took 619147.67ms. Allocated memory is still 83.9MB. Free memory was 37.3MB in the beginning and 47.4MB in the end (delta: -10.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:58:49,225 INFO L158 Benchmark]: Witness Printer took 108.26ms. Allocated memory is still 83.9MB. Free memory was 47.4MB in the beginning and 42.9MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 23:58:49,227 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.34ms. Allocated memory is still 83.9MB. Free memory was 64.2MB in the beginning and 64.1MB in the end (delta: 37.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.57ms. Allocated memory is still 83.9MB. Free memory was 60.2MB in the beginning and 49.4MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.56ms. Allocated memory is still 83.9MB. Free memory was 49.1MB in the beginning and 48.1MB in the end (delta: 922.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.13ms. Allocated memory is still 83.9MB. Free memory was 48.1MB in the beginning and 46.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1360.77ms. Allocated memory is still 83.9MB. Free memory was 46.6MB in the beginning and 37.6MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 619147.67ms. Allocated memory is still 83.9MB. Free memory was 37.3MB in the beginning and 47.4MB in the end (delta: -10.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 108.26ms. Allocated memory is still 83.9MB. Free memory was 47.4MB in the beginning and 42.9MB in the end (delta: 4.5MB). 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 - PositiveResult [Line: 27]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 619.0s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 121.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 30.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 30.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 156 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 13 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 210.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=3, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 494.2s InterpolantComputationTime, 31 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 50 ConstructedInterpolants, 9 QuantifiedInterpolants, 885 SizeOfPredicates, 9 NumberOfNonLiveVariables, 111 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 25/64 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-23 23:58:49,448 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-23 23:58:49,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6da54cce-464e-4e1c-aace-c8a9d069f0c8/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE