./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i --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_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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_7b40d685-0224-49d7-bd32-a34e53d42c1f/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 aa004690edfde808b1aefac96308d2a9e2df62056aeddc89c51bd2015ab29125
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-6497de0
[2024-11-24 00:15:31,262 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-24 00:15:31,385 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-24 00:15:31,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-24 00:15:31,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-24 00:15:31,439 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-24 00:15:31,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-24 00:15:31,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-24 00:15:31,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-24 00:15:31,440 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-24 00:15:31,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-24 00:15:31,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-24 00:15:31,441 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-24 00:15:31,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-24 00:15:31,441 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-24 00:15:31,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-24 00:15:31,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-24 00:15:31,442 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-24 00:15:31,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-24 00:15:31,442 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-24 00:15:31,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-24 00:15:31,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-24 00:15:31,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-24 00:15:31,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-24 00:15:31,443 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-24 00:15:31,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-24 00:15:31,444 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-24 00:15:31,444 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-24 00:15:31,444 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-24 00:15:31,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 00:15:31,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 00:15:31,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 00:15:31,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:15:31,445 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-24 00:15:31,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 00:15:31,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 00:15:31,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 00:15:31,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:15:31,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-24 00:15:31,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-24 00:15:31,446 INFO L153 SettingsManager]: * Compute procedure contracts=false
[2024-11-24 00:15:31,446 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-24 00:15:31,446 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-24 00:15:31,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-24 00:15:31,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-24 00:15:31,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-24 00:15:31,447 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-24 00:15:31,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-24 00:15:31,448 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_7b40d685-0224-49d7-bd32-a34e53d42c1f/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 -> aa004690edfde808b1aefac96308d2a9e2df62056aeddc89c51bd2015ab29125
[2024-11-24 00:15:31,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-24 00:15:31,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-24 00:15:31,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-24 00:15:31,971 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-24 00:15:31,972 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-24 00:15:31,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i
[2024-11-24 00:15:35,656 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/data/0fb20cd80/7891870f79a643baa36707ed18b6639d/FLAG040b21146
[2024-11-24 00:15:35,989 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-24 00:15:35,990 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i
[2024-11-24 00:15:36,018 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/data/0fb20cd80/7891870f79a643baa36707ed18b6639d/FLAG040b21146
[2024-11-24 00:15:36,251 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/data/0fb20cd80/7891870f79a643baa36707ed18b6639d
[2024-11-24 00:15:36,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-24 00:15:36,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-24 00:15:36,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-24 00:15:36,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-24 00:15:36,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-24 00:15:36,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:15:36" (1/1) ...
[2024-11-24 00:15:36,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4397f147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:36, skipping insertion in model container
[2024-11-24 00:15:36,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:15:36" (1/1) ...
[2024-11-24 00:15:36,290 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-24 00:15:36,468 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_7b40d685-0224-49d7-bd32-a34e53d42c1f/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i[808,821]
[2024-11-24 00:15:36,484 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 00:15:36,497 INFO L200 MainTranslator]: Completed pre-run
[2024-11-24 00:15:36,509 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_7b40d685-0224-49d7-bd32-a34e53d42c1f/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i[808,821]
[2024-11-24 00:15:36,512 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 00:15:36,526 INFO L204 MainTranslator]: Completed translation
[2024-11-24 00:15:36,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:36 WrapperNode
[2024-11-24 00:15:36,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-24 00:15:36,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-24 00:15:36,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-24 00:15:36,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-24 00:15:36,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:36" (1/1) ...
[2024-11-24 00:15:36,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:36" (1/1) ...
[2024-11-24 00:15:36,557 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 24
[2024-11-24 00:15:36,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-24 00:15:36,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-24 00:15:36,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-24 00:15:36,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-24 00:15:36,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:36" (1/1) ...
[2024-11-24 00:15:36,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:36" (1/1) ...
[2024-11-24 00:15:36,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:36" (1/1) ...
[2024-11-24 00:15:36,581 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-24 00:15:36,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:36" (1/1) ...
[2024-11-24 00:15:36,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:36" (1/1) ...
[2024-11-24 00:15:36,585 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:36" (1/1) ...
[2024-11-24 00:15:36,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:36" (1/1) ...
[2024-11-24 00:15:36,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:36" (1/1) ...
[2024-11-24 00:15:36,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:36" (1/1) ...
[2024-11-24 00:15:36,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:36" (1/1) ...
[2024-11-24 00:15:36,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-24 00:15:36,597 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-24 00:15:36,597 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-24 00:15:36,597 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-24 00:15:36,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:36" (1/1) ...
[2024-11-24 00:15:36,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:15:36,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:15:36,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-24 00:15:36,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-24 00:15:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-24 00:15:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-24 00:15:36,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-24 00:15:36,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-24 00:15:36,715 INFO L234 CfgBuilder]: Building ICFG
[2024-11-24 00:15:36,717 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-24 00:15:36,791 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live.
[2024-11-24 00:15:36,791 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-24 00:15:36,800 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-24 00:15:36,801 INFO L312 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-24 00:15:36,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:15:36 BoogieIcfgContainer
[2024-11-24 00:15:36,801 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-24 00:15:36,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-24 00:15:36,803 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-24 00:15:36,808 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-24 00:15:36,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:15:36" (1/3) ...
[2024-11-24 00:15:36,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741ab989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:15:36, skipping insertion in model container
[2024-11-24 00:15:36,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:36" (2/3) ...
[2024-11-24 00:15:36,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741ab989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:15:36, skipping insertion in model container
[2024-11-24 00:15:36,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:15:36" (3/3) ...
[2024-11-24 00:15:36,811 INFO L128 eAbstractionObserver]: Analyzing ICFG Double_div_bad.i
[2024-11-24 00:15:36,827 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-24 00:15:36,828 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Double_div_bad.i that has 1 procedures, 12 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2024-11-24 00:15:36,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-24 00:15:36,909 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;@143e9161, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-24 00:15:36,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-24 00:15:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:15:36,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2024-11-24 00:15:36,922 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-24 00:15:36,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-24 00:15:36,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 00:15:36,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:15:36,932 INFO L85 PathProgramCache]: Analyzing trace with hash 889664619, now seen corresponding path program 1 times
[2024-11-24 00:15:36,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 00:15:36,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218178229]
[2024-11-24 00:15:36,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:15:36,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:15:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 00:15:37,045 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-24 00:15:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 00:15:37,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-24 00:15:37,077 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-11-24 00:15:37,079 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-24 00:15:37,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-24 00:15:37,086 INFO L422 BasicCegarLoop]: Path program histogram: [1]
[2024-11-24 00:15:37,101 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-24 00:15:37,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 12:15:37 BoogieIcfgContainer
[2024-11-24 00:15:37,109 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-24 00:15:37,110 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-24 00:15:37,111 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-24 00:15:37,112 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-24 00:15:37,113 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:15:36" (3/4) ...
[2024-11-24 00:15:37,116 INFO L149 WitnessPrinter]: No result that supports witness generation found
[2024-11-24 00:15:37,117 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-24 00:15:37,119 INFO L158 Benchmark]: Toolchain (without parser) took 862.50ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 71.7MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2024-11-24 00:15:37,119 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 167.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 00:15:37,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.06ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 95.3MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-24 00:15:37,121 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.71ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 00:15:37,122 INFO L158 Benchmark]: Boogie Preprocessor took 37.73ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 93.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 00:15:37,122 INFO L158 Benchmark]: RCFGBuilder took 204.08ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 84.1MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-24 00:15:37,123 INFO L158 Benchmark]: TraceAbstraction took 306.41ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 72.1MB in the end (delta: 11.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-24 00:15:37,127 INFO L158 Benchmark]: Witness Printer took 7.01ms. Allocated memory is still 142.6MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-24 00:15:37,129 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.74ms. Allocated memory is still 167.8MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 270.06ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 95.3MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 29.71ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 37.73ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 93.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 204.08ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 84.1MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 306.41ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 72.1MB in the end (delta: 11.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Witness Printer took 7.01ms. Allocated memory is still 142.6MB. Free memory is still 71.7MB. 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: 13]: 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 21, overapproximation of someBinaryDOUBLEComparisonOperation at line 29, overapproximation of someBinaryDOUBLEComparisonOperation at line 23.
Possible FailurePath:
[L20] double x = 1.0;
[L21] double x1 = x/1.6;
[L23] COND FALSE !(x1 != x)
[L29] CALL __VERIFIER_assert(x == 0)
[L13] COND TRUE !(cond)
[L13] reach_error()
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 12 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=12occurred 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, 6 NumberOfCodeBlocks, 6 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-24 00:15:37,158 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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_7b40d685-0224-49d7-bd32-a34e53d42c1f/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 aa004690edfde808b1aefac96308d2a9e2df62056aeddc89c51bd2015ab29125
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-6497de0
[2024-11-24 00:15:40,108 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-24 00:15:40,208 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-24 00:15:40,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-24 00:15:40,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-24 00:15:40,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-24 00:15:40,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-24 00:15:40,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-24 00:15:40,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-24 00:15:40,242 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-24 00:15:40,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-24 00:15:40,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-24 00:15:40,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-24 00:15:40,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-24 00:15:40,243 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-24 00:15:40,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-24 00:15:40,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-24 00:15:40,243 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-24 00:15:40,243 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-24 00:15:40,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-24 00:15:40,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-24 00:15:40,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-24 00:15:40,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-24 00:15:40,244 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-24 00:15:40,244 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-24 00:15:40,244 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-24 00:15:40,244 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-24 00:15:40,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-24 00:15:40,244 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-24 00:15:40,244 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-24 00:15:40,244 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-24 00:15:40,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 00:15:40,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 00:15:40,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 00:15:40,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:15:40,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-24 00:15:40,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 00:15:40,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-24 00:15:40,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 00:15:40,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:15:40,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-24 00:15:40,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-24 00:15:40,246 INFO L153 SettingsManager]: * Compute procedure contracts=false
[2024-11-24 00:15:40,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-24 00:15:40,246 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-24 00:15:40,246 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-24 00:15:40,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-24 00:15:40,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-24 00:15:40,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-24 00:15:40,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-24 00:15:40,246 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_7b40d685-0224-49d7-bd32-a34e53d42c1f/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 -> aa004690edfde808b1aefac96308d2a9e2df62056aeddc89c51bd2015ab29125
[2024-11-24 00:15:40,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-24 00:15:40,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-24 00:15:40,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-24 00:15:40,634 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-24 00:15:40,635 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-24 00:15:40,637 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i
[2024-11-24 00:15:43,754 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/data/78f9bd954/2602c9c383d24620a4ead35c05f777e6/FLAGbaa346497
[2024-11-24 00:15:44,093 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-24 00:15:44,094 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i
[2024-11-24 00:15:44,106 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/data/78f9bd954/2602c9c383d24620a4ead35c05f777e6/FLAGbaa346497
[2024-11-24 00:15:44,361 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/data/78f9bd954/2602c9c383d24620a4ead35c05f777e6
[2024-11-24 00:15:44,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-24 00:15:44,367 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-24 00:15:44,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-24 00:15:44,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-24 00:15:44,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-24 00:15:44,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:15:44" (1/1) ...
[2024-11-24 00:15:44,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f4a9a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:44, skipping insertion in model container
[2024-11-24 00:15:44,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:15:44" (1/1) ...
[2024-11-24 00:15:44,400 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-24 00:15:44,573 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_7b40d685-0224-49d7-bd32-a34e53d42c1f/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i[808,821]
[2024-11-24 00:15:44,593 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 00:15:44,616 INFO L200 MainTranslator]: Completed pre-run
[2024-11-24 00:15:44,628 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_7b40d685-0224-49d7-bd32-a34e53d42c1f/sv-benchmarks/c/floats-esbmc-regression/Double_div_bad.i[808,821]
[2024-11-24 00:15:44,631 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 00:15:44,651 INFO L204 MainTranslator]: Completed translation
[2024-11-24 00:15:44,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:44 WrapperNode
[2024-11-24 00:15:44,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-24 00:15:44,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-24 00:15:44,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-24 00:15:44,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-24 00:15:44,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:44" (1/1) ...
[2024-11-24 00:15:44,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:44" (1/1) ...
[2024-11-24 00:15:44,690 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 25
[2024-11-24 00:15:44,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-24 00:15:44,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-24 00:15:44,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-24 00:15:44,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-24 00:15:44,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:44" (1/1) ...
[2024-11-24 00:15:44,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:44" (1/1) ...
[2024-11-24 00:15:44,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:44" (1/1) ...
[2024-11-24 00:15:44,716 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-24 00:15:44,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:44" (1/1) ...
[2024-11-24 00:15:44,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:44" (1/1) ...
[2024-11-24 00:15:44,723 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:44" (1/1) ...
[2024-11-24 00:15:44,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:44" (1/1) ...
[2024-11-24 00:15:44,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:44" (1/1) ...
[2024-11-24 00:15:44,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:44" (1/1) ...
[2024-11-24 00:15:44,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:44" (1/1) ...
[2024-11-24 00:15:44,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-24 00:15:44,736 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-24 00:15:44,737 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-24 00:15:44,737 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-24 00:15:44,738 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:44" (1/1) ...
[2024-11-24 00:15:44,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 00:15:44,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:15:44,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-24 00:15:44,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-24 00:15:44,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-24 00:15:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-24 00:15:44,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-24 00:15:44,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-24 00:15:44,920 INFO L234 CfgBuilder]: Building ICFG
[2024-11-24 00:15:44,922 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-24 00:15:47,597 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live.
[2024-11-24 00:15:47,597 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-24 00:15:47,609 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-24 00:15:47,609 INFO L312 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-24 00:15:47,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:15:47 BoogieIcfgContainer
[2024-11-24 00:15:47,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-24 00:15:47,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-24 00:15:47,613 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-24 00:15:47,620 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-24 00:15:47,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:15:44" (1/3) ...
[2024-11-24 00:15:47,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65078ea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:15:47, skipping insertion in model container
[2024-11-24 00:15:47,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:15:44" (2/3) ...
[2024-11-24 00:15:47,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65078ea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:15:47, skipping insertion in model container
[2024-11-24 00:15:47,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:15:47" (3/3) ...
[2024-11-24 00:15:47,624 INFO L128 eAbstractionObserver]: Analyzing ICFG Double_div_bad.i
[2024-11-24 00:15:47,644 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-24 00:15:47,646 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Double_div_bad.i that has 1 procedures, 12 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2024-11-24 00:15:47,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-24 00:15:47,720 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;@42106962, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-24 00:15:47,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-24 00:15:47,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:15:47,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2024-11-24 00:15:47,728 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-24 00:15:47,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-24 00:15:47,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 00:15:47,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:15:47,734 INFO L85 PathProgramCache]: Analyzing trace with hash 889664619, now seen corresponding path program 1 times
[2024-11-24 00:15:47,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 00:15:47,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27855742]
[2024-11-24 00:15:47,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:15:47,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-24 00:15:47,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/mathsat
[2024-11-24 00:15:47,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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-24 00:15:47,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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-24 00:15:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:15:48,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-24 00:15:48,638 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:15:49,512 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-24 00:15:49,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-24 00:15:49,514 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 00:15:49,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27855742]
[2024-11-24 00:15:49,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27855742] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 00:15:49,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 00:15:49,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 00:15:49,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535283953]
[2024-11-24 00:15:49,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 00:15:49,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-24 00:15:49,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 00:15:49,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-24 00:15:49,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-24 00:15:49,550 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-24 00:15:52,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:15:53,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:15:56,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:15:56,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 00:15:56,821 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions.
[2024-11-24 00:15:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 00:15:56,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-24 00:15:56,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 00:15:56,855 INFO L225 Difference]: With dead ends: 21
[2024-11-24 00:15:56,855 INFO L226 Difference]: Without dead ends: 9
[2024-11-24 00:15:56,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-24 00:15:56,861 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time
[2024-11-24 00:15:56,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time]
[2024-11-24 00:15:56,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states.
[2024-11-24 00:15:56,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9.
[2024-11-24 00:15:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:15:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions.
[2024-11-24 00:15:56,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6
[2024-11-24 00:15:56,900 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-24 00:15:56,900 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions.
[2024-11-24 00:15:56,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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-24 00:15:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions.
[2024-11-24 00:15:56,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-24 00:15:56,902 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-24 00:15:56,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:15:56,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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-24 00:15:57,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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-24 00:15:57,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 00:15:57,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:15:57,104 INFO L85 PathProgramCache]: Analyzing trace with hash 207982255, now seen corresponding path program 1 times
[2024-11-24 00:15:57,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 00:15:57,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043774510]
[2024-11-24 00:15:57,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:15:57,105 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-24 00:15:57,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/mathsat
[2024-11-24 00:15:57,107 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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-24 00:15:57,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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-24 00:15:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:15:58,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-24 00:15:58,806 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:16:06,249 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-24 00:16:06,249 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-24 00:16:14,879 WARN L286 SmtUtils]: Spent 8.07s 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-24 00:16:18,920 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) |c_ULTIMATE.start_main_~x1~0#1|)) is different from false
[2024-11-24 00:16:32,340 WARN L286 SmtUtils]: Spent 8.26s 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-24 00:16:36,460 WARN L851 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from false
[2024-11-24 00:16:40,567 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) is different from true
[2024-11-24 00:16:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-11-24 00:16:40,568 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 00:16:40,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043774510]
[2024-11-24 00:16:40,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043774510] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-24 00:16:40,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-24 00:16:40,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7
[2024-11-24 00:16:40,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180050693]
[2024-11-24 00:16:40,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-24 00:16:40,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-24 00:16:40,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 00:16:40,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-24 00:16:40,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=20, Unknown=3, NotChecked=18, Total=56
[2024-11-24 00:16:40,573 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:16:44,734 WARN L873 $PredicateComparison]: unable to prove that (and (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1))) (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2024-11-24 00:16:57,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:17:01,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:17:01,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 00:17:01,994 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions.
[2024-11-24 00:17:01,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 00:17:01,995 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2024-11-24 00:17:01,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 00:17:01,996 INFO L225 Difference]: With dead ends: 15
[2024-11-24 00:17:01,996 INFO L226 Difference]: Without dead ends: 11
[2024-11-24 00:17:01,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 38.4s TimeCoverageRelationStatistics Valid=26, Invalid=37, Unknown=5, NotChecked=42, Total=110
[2024-11-24 00:17:01,997 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time
[2024-11-24 00:17:01,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 9 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 23 Unchecked, 3.9s Time]
[2024-11-24 00:17:01,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states.
[2024-11-24 00:17:02,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11.
[2024-11-24 00:17:02,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:17:02,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions.
[2024-11-24 00:17:02,002 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8
[2024-11-24 00:17:02,002 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-24 00:17:02,002 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions.
[2024-11-24 00:17:02,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:17:02,002 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions.
[2024-11-24 00:17:02,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2024-11-24 00:17:02,003 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-24 00:17:02,003 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:17:02,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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-24 00:17:02,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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-24 00:17:02,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 00:17:02,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:17:02,205 INFO L85 PathProgramCache]: Analyzing trace with hash -2053740557, now seen corresponding path program 2 times
[2024-11-24 00:17:02,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 00:17:02,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810309153]
[2024-11-24 00:17:02,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-24 00:17:02,206 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-24 00:17:02,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/mathsat
[2024-11-24 00:17:02,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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-24 00:17:02,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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-24 00:17:04,807 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-24 00:17:04,807 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:17:04,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-24 00:17:04,886 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:17:15,842 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-24 00:17:19,975 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2024-11-24 00:17:28,445 WARN L286 SmtUtils]: Spent 8.44s 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-24 00:17:38,427 WARN L286 SmtUtils]: Spent 8.69s 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-24 00:17:44,590 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2024-11-24 00:17:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked.
[2024-11-24 00:17:44,602 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-24 00:17:51,547 WARN L286 SmtUtils]: Spent 5.37s 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-24 00:18:33,504 WARN L286 SmtUtils]: Spent 10.26s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-11-24 00:18:49,915 WARN L286 SmtUtils]: Spent 8.60s 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-24 00:18:58,265 WARN L286 SmtUtils]: Spent 8.35s 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-24 00:19:02,399 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_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-24 00:19:06,537 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_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-24 00:19:15,038 WARN L286 SmtUtils]: Spent 8.50s 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-24 00:19:23,396 WARN L286 SmtUtils]: Spent 8.36s 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-24 00:19:32,078 WARN L286 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-24 00:19:40,887 WARN L286 SmtUtils]: Spent 8.81s 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-24 00:19:45,104 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .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-24 00:19:49,314 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .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-24 00:19:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked.
[2024-11-24 00:19:49,315 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 00:19:49,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810309153]
[2024-11-24 00:19:49,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810309153] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-24 00:19:49,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-24 00:19:49,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11
[2024-11-24 00:19:49,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464935070]
[2024-11-24 00:19:49,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-24 00:19:49,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-24 00:19:49,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 00:19:49,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-24 00:19:49,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=38, Unknown=11, NotChecked=60, Total=132
[2024-11-24 00:19:49,318 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 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-24 00:19:53,998 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .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-24 00:19:58,166 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_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)))) (= |c_ULTIMATE.start_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-24 00:20:02,354 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2024-11-24 00:20:28,064 WARN L286 SmtUtils]: Spent 10.15s on a formula simplification. DAG size of input: 21 DAG size of output: 15 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-11-24 00:20:29,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:20:32,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:20:53,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:20:55,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:20:59,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:21:13,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:21:17,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:21:30,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:21:34,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:21:38,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:21:47,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:21:51,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:21:54,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:21:55,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:21:59,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:21:59,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 00:21:59,192 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions.
[2024-11-24 00:21:59,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-11-24 00:21:59,236 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10
[2024-11-24 00:21:59,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 00:21:59,237 INFO L225 Difference]: With dead ends: 21
[2024-11-24 00:21:59,237 INFO L226 Difference]: Without dead ends: 15
[2024-11-24 00:21:59,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 153.0s TimeCoverageRelationStatistics Valid=52, Invalid=108, Unknown=24, NotChecked=196, Total=380
[2024-11-24 00:21:59,238 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 47.9s IncrementalHoareTripleChecker+Time
[2024-11-24 00:21:59,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 9 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 8 Unknown, 92 Unchecked, 47.9s Time]
[2024-11-24 00:21:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states.
[2024-11-24 00:21:59,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2024-11-24 00:21:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:21:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions.
[2024-11-24 00:21:59,243 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10
[2024-11-24 00:21:59,244 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-24 00:21:59,244 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions.
[2024-11-24 00:21:59,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 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-24 00:21:59,244 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions.
[2024-11-24 00:21:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2024-11-24 00:21:59,244 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-24 00:21:59,244 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:21:59,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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-24 00:21:59,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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-24 00:21:59,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 00:21:59,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:21:59,446 INFO L85 PathProgramCache]: Analyzing trace with hash -858744965, now seen corresponding path program 3 times
[2024-11-24 00:21:59,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 00:21:59,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343193006]
[2024-11-24 00:21:59,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-24 00:21:59,446 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-24 00:21:59,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/mathsat
[2024-11-24 00:21:59,450 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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-24 00:21:59,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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-24 00:22:04,601 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2024-11-24 00:22:04,601 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:22:04,745 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-11-24 00:22:04,747 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:22:16,185 WARN L286 SmtUtils]: Spent 8.53s 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-24 00:22:37,812 WARN L286 SmtUtils]: Spent 8.53s 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-24 00:22:46,701 WARN L286 SmtUtils]: Spent 8.84s 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-24 00:22:51,052 WARN L873 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.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_~x1~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2024-11-24 00:23:00,061 WARN L286 SmtUtils]: Spent 8.97s 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-24 00:23:10,948 WARN L286 SmtUtils]: Spent 9.12s 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-24 00:23:14,997 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (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_~x~0#1|) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false
[2024-11-24 00:23:19,241 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (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_~x~0#1|) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2024-11-24 00:23:28,912 WARN L286 SmtUtils]: Spent 9.58s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-24 00:23:33,303 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.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_currentRoundingMode roundNearestTiesToEven)) is different from true
[2024-11-24 00:23:43,974 WARN L286 SmtUtils]: Spent 9.57s 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-24 00:23:48,029 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_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_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false
[2024-11-24 00:23:52,416 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_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_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2024-11-24 00:23:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 14 not checked.
[2024-11-24 00:23:52,424 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-24 00:24:02,691 WARN L873 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) |c_ULTIMATE.start_main_~x1~0#1|))) is different from true
[2024-11-24 00:24:14,388 WARN L286 SmtUtils]: Spent 7.20s 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-24 00:24:22,522 WARN L286 SmtUtils]: Spent 8.13s 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-24 00:24:28,379 WARN L873 $PredicateComparison]: unable to prove that (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0))) |c_ULTIMATE.start_main_~x1~0#1|))) is different from true
[2024-11-24 00:24:36,928 WARN L286 SmtUtils]: Spent 8.55s 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-24 00:24:45,473 WARN L286 SmtUtils]: Spent 8.54s 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-24 00:24:53,875 WARN L286 SmtUtils]: Spent 8.40s 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-24 00:24:58,033 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (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-24 00:25:02,192 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (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-24 00:25:10,765 WARN L286 SmtUtils]: Spent 8.57s 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-24 00:25:19,311 WARN L286 SmtUtils]: Spent 8.55s 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-24 00:25:27,707 WARN L286 SmtUtils]: Spent 8.40s 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-24 00:25:36,492 WARN L286 SmtUtils]: Spent 8.78s 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-24 00:25:45,421 WARN L286 SmtUtils]: Spent 8.93s 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-24 00:25:54,380 WARN L286 SmtUtils]: Spent 8.96s 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-24 00:25:58,649 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 .cse1) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)))))) is different from false
[2024-11-24 00:26:02,913 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 .cse1) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)))))) is different from true
[2024-11-24 00:26:11,743 WARN L286 SmtUtils]: Spent 8.83s 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-24 00:26:20,817 WARN L286 SmtUtils]: Spent 9.07s 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-24 00:26:29,931 WARN L286 SmtUtils]: Spent 9.11s 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-24 00:26:39,164 WARN L286 SmtUtils]: Spent 9.23s 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-24 00:26:48,313 WARN L286 SmtUtils]: Spent 9.15s 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-24 00:26:57,606 WARN L286 SmtUtils]: Spent 9.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-24 00:27:02,000 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)))))) is different from false
[2024-11-24 00:27:06,341 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)))))) is different from true
[2024-11-24 00:27:15,592 WARN L286 SmtUtils]: Spent 9.25s 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-24 00:27:24,679 WARN L286 SmtUtils]: Spent 9.09s 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-24 00:27:34,051 WARN L286 SmtUtils]: Spent 9.37s 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-24 00:27:44,402 WARN L286 SmtUtils]: Spent 10.35s 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-24 00:27:54,525 WARN L286 SmtUtils]: Spent 10.12s 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-24 00:28:04,256 WARN L286 SmtUtils]: Spent 9.73s 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-24 00:28:08,778 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse2))))) is different from false
[2024-11-24 00:28:13,316 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse2))))) is different from true
[2024-11-24 00:28:13,317 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked.
[2024-11-24 00:28:13,317 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-24 00:28:13,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343193006]
[2024-11-24 00:28:13,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343193006] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-24 00:28:13,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-24 00:28:13,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17
[2024-11-24 00:28:13,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492668977]
[2024-11-24 00:28:13,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-24 00:28:13,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2024-11-24 00:28:13,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-24 00:28:13,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2024-11-24 00:28:13,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=42, Unknown=18, NotChecked=210, Total=306
[2024-11-24 00:28:13,320 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:28:18,145 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2024-11-24 00:28:22,373 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse0))) (or (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse1 .cse2) (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false
[2024-11-24 00:28:26,704 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0)) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse0))) (or (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse1 .cse2) (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2024-11-24 00:28:31,085 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 .cse1) (fp.eq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0))))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse2) .cse2)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2024-11-24 00:28:35,191 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (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_~x1~0#1|) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0))) (or (fp.eq .cse1 |c_ULTIMATE.start_main_~x1~0#1|) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false
[2024-11-24 00:28:39,375 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (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_~x1~0#1|) (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0))) (or (fp.eq .cse1 |c_ULTIMATE.start_main_~x1~0#1|) (fp.eq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2024-11-24 00:28:43,467 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (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_~x~0#1|) (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false
[2024-11-24 00:28:48,344 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (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_~x~0#1|) (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2024-11-24 00:28:52,475 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (and (or (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|))) (= |c_ULTIMATE.start_main_~x1~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-24 00:29:27,345 WARN L286 SmtUtils]: Spent 13.85s 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-24 00:29:31,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:29:33,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-24 00:29:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 00:29:34,873 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions.
[2024-11-24 00:29:34,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-24 00:29:34,874 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14
[2024-11-24 00:29:34,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-24 00:29:34,875 INFO L225 Difference]: With dead ends: 21
[2024-11-24 00:29:34,875 INFO L226 Difference]: Without dead ends: 17
[2024-11-24 00:29:34,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 160.8s TimeCoverageRelationStatistics Valid=52, Invalid=54, Unknown=30, NotChecked=464, Total=600
[2024-11-24 00:29:34,877 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 214 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time
[2024-11-24 00:29:34,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 15 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 1 Unknown, 214 Unchecked, 7.7s Time]
[2024-11-24 00:29:34,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states.
[2024-11-24 00:29:34,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17.
[2024-11-24 00:29:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 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-24 00:29:34,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions.
[2024-11-24 00:29:34,885 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14
[2024-11-24 00:29:34,885 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-24 00:29:34,886 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions.
[2024-11-24 00:29:34,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:29:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions.
[2024-11-24 00:29:34,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2024-11-24 00:29:34,887 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-24 00:29:34,887 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:29:34,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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)] Ended with exit code 0
[2024-11-24 00:29:35,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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-24 00:29:35,088 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-24 00:29:35,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:29:35,088 INFO L85 PathProgramCache]: Analyzing trace with hash -681415233, now seen corresponding path program 4 times
[2024-11-24 00:29:35,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-24 00:29:35,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078408762]
[2024-11-24 00:29:35,088 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-24 00:29:35,089 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-24 00:29:35,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/mathsat
[2024-11-24 00:29:35,091 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/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-24 00:29:35,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7b40d685-0224-49d7-bd32-a34e53d42c1f/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2024-11-24 00:29:40,598 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-24 00:29:40,598 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 00:29:40,788 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-11-24 00:29:40,791 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:29:56,398 WARN L286 SmtUtils]: Spent 8.35s 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-24 00:30:00,580 WARN L851 $PredicateComparison]: unable to prove that (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0))) is different from false
[2024-11-24 00:30:04,764 WARN L873 $PredicateComparison]: unable to prove that (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse0) .cse0))) is different from true
[2024-11-24 00:30:13,137 WARN L286 SmtUtils]: Spent 8.37s 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-24 00:30:21,737 WARN L286 SmtUtils]: Spent 8.60s 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-24 00:30:26,008 WARN L851 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.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_~x1~0#1|) is different from false
[2024-11-24 00:30:30,297 WARN L873 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.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_~x1~0#1|) is different from true
[2024-11-24 00:30:38,876 WARN L286 SmtUtils]: Spent 8.58s 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-24 00:30:47,882 WARN L286 SmtUtils]: Spent 9.00s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-24 00:30:52,340 WARN L851 $PredicateComparison]: unable to prove that (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.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))) is different from false
[2024-11-24 00:30:56,846 WARN L873 $PredicateComparison]: unable to prove that (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 8.0 5.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))) is different from true
[2024-11-24 00:31:05,992 WARN L286 SmtUtils]: Spent 9.15s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)