./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd --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 497906435138d6e8ed86f6117a3a5c3feed8c22116354c349b2936471319931d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:48:50,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:48:50,479 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:48:50,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:48:50,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:48:50,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:48:50,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:48:50,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:48:50,529 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:48:50,529 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:48:50,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:48:50,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:48:50,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:48:50,531 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:48:50,531 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:48:50,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:48:50,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:48:50,532 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:48:50,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:48:50,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:48:50,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:48:50,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:48:50,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:48:50,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:48:50,533 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:48:50,533 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:48:50,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:48:50,534 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:48:50,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:48:50,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:48:50,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:48:50,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:48:50,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:48:50,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:48:50,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:48:50,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:48:50,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:48:50,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:48:50,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:48:50,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:48:50,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:48:50,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:48:50,535 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_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd 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 -> 497906435138d6e8ed86f6117a3a5c3feed8c22116354c349b2936471319931d [2024-11-13 14:48:50,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:48:50,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:48:50,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:48:50,889 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:48:50,890 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:48:50,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i Unable to find full path for "g++" [2024-11-13 14:48:53,127 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:48:53,424 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:48:53,424 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i [2024-11-13 14:48:53,432 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/data/efe1dfbb4/eb6d4b11129944c4bcc0dcd2843d79b3/FLAGeb4a9cd77 [2024-11-13 14:48:53,457 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/data/efe1dfbb4/eb6d4b11129944c4bcc0dcd2843d79b3 [2024-11-13 14:48:53,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:48:53,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:48:53,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:48:53,470 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:48:53,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:48:53,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:48:53" (1/1) ... [2024-11-13 14:48:53,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f25bbb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:53, skipping insertion in model container [2024-11-13 14:48:53,480 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:48:53" (1/1) ... [2024-11-13 14:48:53,499 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:48:53,704 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_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2024-11-13 14:48:53,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:48:53,733 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:48:53,748 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_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2024-11-13 14:48:53,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:48:53,773 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:48:53,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:53 WrapperNode [2024-11-13 14:48:53,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:48:53,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:48:53,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:48:53,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:48:53,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:53" (1/1) ... [2024-11-13 14:48:53,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:53" (1/1) ... [2024-11-13 14:48:53,817 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 24 [2024-11-13 14:48:53,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:48:53,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:48:53,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:48:53,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:48:53,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:53" (1/1) ... [2024-11-13 14:48:53,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:53" (1/1) ... [2024-11-13 14:48:53,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:53" (1/1) ... [2024-11-13 14:48:53,846 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-13 14:48:53,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:53" (1/1) ... [2024-11-13 14:48:53,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:53" (1/1) ... [2024-11-13 14:48:53,854 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:53" (1/1) ... [2024-11-13 14:48:53,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:53" (1/1) ... [2024-11-13 14:48:53,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:53" (1/1) ... [2024-11-13 14:48:53,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:53" (1/1) ... [2024-11-13 14:48:53,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:48:53,870 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:48:53,870 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:48:53,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:48:53,872 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:53" (1/1) ... [2024-11-13 14:48:53,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:48:53,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:48:53,920 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:48:53,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:48:53,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:48:53,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:48:53,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:48:53,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:48:54,041 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:48:54,043 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:48:54,183 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-13 14:48:54,183 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:48:54,195 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:48:54,196 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:48:54,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:48:54 BoogieIcfgContainer [2024-11-13 14:48:54,197 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:48:54,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:48:54,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:48:54,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:48:54,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:48:53" (1/3) ... [2024-11-13 14:48:54,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9aeab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:48:54, skipping insertion in model container [2024-11-13 14:48:54,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:48:53" (2/3) ... [2024-11-13 14:48:54,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d9aeab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:48:54, skipping insertion in model container [2024-11-13 14:48:54,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:48:54" (3/3) ... [2024-11-13 14:48:54,214 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i [2024-11-13 14:48:54,235 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:48:54,240 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG Float_div_bad.i that has 1 procedures, 11 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:48:54,320 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:48:54,339 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;@6fab4edf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:48:54,339 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:48:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:48:54,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 14:48:54,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:48:54,354 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 14:48:54,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:48:54,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:48:54,365 INFO L85 PathProgramCache]: Analyzing trace with hash 889603051, now seen corresponding path program 1 times [2024-11-13 14:48:54,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:48:54,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950663112] [2024-11-13 14:48:54,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:48:54,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:48:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:48:54,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:48:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:48:54,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:48:54,544 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:48:54,546 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:48:54,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:48:54,558 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-13 14:48:54,576 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:48:54,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:48:54 BoogieIcfgContainer [2024-11-13 14:48:54,582 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:48:54,583 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:48:54,583 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:48:54,584 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:48:54,584 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:48:54" (3/4) ... [2024-11-13 14:48:54,588 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:48:54,589 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:48:54,590 INFO L158 Benchmark]: Toolchain (without parser) took 1124.43ms. Allocated memory is still 117.4MB. Free memory was 94.6MB in the beginning and 60.4MB in the end (delta: 34.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 14:48:54,594 INFO L158 Benchmark]: CDTParser took 1.67ms. Allocated memory is still 167.8MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:48:54,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.45ms. Allocated memory is still 117.4MB. Free memory was 94.6MB in the beginning and 83.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:48:54,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.71ms. Allocated memory is still 117.4MB. Free memory was 83.8MB in the beginning and 82.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:48:54,595 INFO L158 Benchmark]: Boogie Preprocessor took 50.61ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 81.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:48:54,595 INFO L158 Benchmark]: RCFGBuilder took 327.07ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 72.7MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:48:54,596 INFO L158 Benchmark]: TraceAbstraction took 381.20ms. Allocated memory is still 117.4MB. Free memory was 72.0MB in the beginning and 60.4MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:48:54,596 INFO L158 Benchmark]: Witness Printer took 6.16ms. Allocated memory is still 117.4MB. Free memory is still 60.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:48:54,602 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.67ms. Allocated memory is still 167.8MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.45ms. Allocated memory is still 117.4MB. Free memory was 94.6MB in the beginning and 83.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.71ms. Allocated memory is still 117.4MB. Free memory was 83.8MB in the beginning and 82.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.61ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 81.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 327.07ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 72.7MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 381.20ms. Allocated memory is still 117.4MB. Free memory was 72.0MB in the beginning and 60.4MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Witness Printer took 6.16ms. Allocated memory is still 117.4MB. Free memory is still 60.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 someBinaryFLOATComparisonOperation at line 23, overapproximation of someBinaryFLOATComparisonOperation at line 29, overapproximation of someBinaryArithmeticFLOAToperation at line 21. Possible FailurePath: [L20] float x = 1.0f; [L21] float x1 = x/1.6f; [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, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, 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=11occurred 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 14:48:54,642 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/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_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd --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 497906435138d6e8ed86f6117a3a5c3feed8c22116354c349b2936471319931d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:48:57,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:48:57,719 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:48:57,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:48:57,735 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:48:57,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:48:57,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:48:57,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:48:57,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:48:57,773 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:48:57,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:48:57,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:48:57,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:48:57,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:48:57,776 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:48:57,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:48:57,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:48:57,776 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:48:57,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:48:57,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:48:57,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:48:57,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:48:57,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:48:57,778 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:48:57,778 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:48:57,778 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:48:57,778 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:48:57,778 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:48:57,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:48:57,778 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:48:57,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:48:57,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:48:57,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:48:57,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:48:57,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:48:57,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:48:57,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:48:57,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:48:57,781 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:48:57,781 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:48:57,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:48:57,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:48:57,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:48:57,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:48:57,782 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_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd 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 -> 497906435138d6e8ed86f6117a3a5c3feed8c22116354c349b2936471319931d [2024-11-13 14:48:58,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:48:58,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:48:58,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:48:58,143 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:48:58,144 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:48:58,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i Unable to find full path for "g++" [2024-11-13 14:49:00,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:49:00,450 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:49:00,451 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i [2024-11-13 14:49:00,460 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/data/fc7aa6a75/bfaa268c35f74fa0b6bf6caf2de511f3/FLAG11c101c02 [2024-11-13 14:49:00,478 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/data/fc7aa6a75/bfaa268c35f74fa0b6bf6caf2de511f3 [2024-11-13 14:49:00,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:49:00,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:49:00,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:49:00,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:49:00,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:49:00,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:49:00" (1/1) ... [2024-11-13 14:49:00,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62a57144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:00, skipping insertion in model container [2024-11-13 14:49:00,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:49:00" (1/1) ... [2024-11-13 14:49:00,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:49:00,711 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_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2024-11-13 14:49:00,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:49:00,751 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:49:00,767 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_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i[807,820] [2024-11-13 14:49:00,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:49:00,795 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:49:00,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:00 WrapperNode [2024-11-13 14:49:00,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:49:00,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:49:00,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:49:00,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:49:00,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:00" (1/1) ... [2024-11-13 14:49:00,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:00" (1/1) ... [2024-11-13 14:49:00,845 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 25 [2024-11-13 14:49:00,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:49:00,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:49:00,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:49:00,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:49:00,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:00" (1/1) ... [2024-11-13 14:49:00,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:00" (1/1) ... [2024-11-13 14:49:00,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:00" (1/1) ... [2024-11-13 14:49:00,880 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-13 14:49:00,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:00" (1/1) ... [2024-11-13 14:49:00,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:00" (1/1) ... [2024-11-13 14:49:00,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:00" (1/1) ... [2024-11-13 14:49:00,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:00" (1/1) ... [2024-11-13 14:49:00,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:00" (1/1) ... [2024-11-13 14:49:00,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:00" (1/1) ... [2024-11-13 14:49:00,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:49:00,906 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:49:00,906 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:49:00,906 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:49:00,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:00" (1/1) ... [2024-11-13 14:49:00,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:49:00,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:49:00,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:49:00,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:49:00,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:49:00,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:49:00,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:49:00,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:49:01,079 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:49:01,081 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:49:02,686 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-13 14:49:02,687 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:49:02,700 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:49:02,701 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:49:02,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:49:02 BoogieIcfgContainer [2024-11-13 14:49:02,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:49:02,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:49:02,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:49:02,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:49:02,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:49:00" (1/3) ... [2024-11-13 14:49:02,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383be7af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:49:02, skipping insertion in model container [2024-11-13 14:49:02,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:49:00" (2/3) ... [2024-11-13 14:49:02,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383be7af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:49:02, skipping insertion in model container [2024-11-13 14:49:02,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:49:02" (3/3) ... [2024-11-13 14:49:02,717 INFO L112 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i [2024-11-13 14:49:02,739 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:49:02,741 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG Float_div_bad.i that has 1 procedures, 11 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:49:02,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:49:02,841 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;@686cf804, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:49:02,841 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:49:02,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:49:02,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 14:49:02,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:02,855 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 14:49:02,856 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:02,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:02,862 INFO L85 PathProgramCache]: Analyzing trace with hash 889603051, now seen corresponding path program 1 times [2024-11-13 14:49:02,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:49:02,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080982058] [2024-11-13 14:49:02,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:02,880 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-13 14:49:02,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:49:02,888 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:02,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:03,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 14:49:03,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:03,946 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-13 14:49:03,947 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:49:03,947 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:49:03,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080982058] [2024-11-13 14:49:03,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080982058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:49:03,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:49:03,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:49:03,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071465879] [2024-11-13 14:49:03,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:49:03,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:49:03,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:49:03,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:49:03,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:49:03,981 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-13 14:49:05,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:05,018 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-11-13 14:49:05,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:49:05,021 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-13 14:49:05,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:05,027 INFO L225 Difference]: With dead ends: 20 [2024-11-13 14:49:05,028 INFO L226 Difference]: Without dead ends: 8 [2024-11-13 14:49:05,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:49:05,034 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:05,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 14 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:49:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-11-13 14:49:05,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-11-13 14:49:05,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:49:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-11-13 14:49:05,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2024-11-13 14:49:05,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:05,085 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-11-13 14:49:05,085 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-13 14:49:05,085 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-11-13 14:49:05,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 14:49:05,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:05,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:05,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-13 14:49:05,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:05,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:05,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1809556175, now seen corresponding path program 1 times [2024-11-13 14:49:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:49:05,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966659808] [2024-11-13 14:49:05,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:05,288 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-13 14:49:05,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:49:05,290 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:05,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:05,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 14:49:05,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:06,828 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-13 14:49:06,828 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:49:24,795 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-13 14:49:24,795 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:49:24,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966659808] [2024-11-13 14:49:24,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966659808] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:49:24,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:49:24,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-13 14:49:24,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504451635] [2024-11-13 14:49:24,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:49:24,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 14:49:24,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:49:24,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 14:49:24,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=27, Unknown=1, NotChecked=0, Total=42 [2024-11-13 14:49:24,799 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-13 14:49:41,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:49:45,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:49:49,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:49:49,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:49,306 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2024-11-13 14:49:49,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 14:49:49,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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) Word has length 7 [2024-11-13 14:49:49,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:49,316 INFO L225 Difference]: With dead ends: 15 [2024-11-13 14:49:49,316 INFO L226 Difference]: Without dead ends: 11 [2024-11-13 14:49:49,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=39, Invalid=69, Unknown=2, NotChecked=0, Total=110 [2024-11-13 14:49:49,317 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:49,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 12.8s Time] [2024-11-13 14:49:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-13 14:49:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-11-13 14:49:49,321 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-13 14:49:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-11-13 14:49:49,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-11-13 14:49:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:49,324 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-11-13 14:49:49,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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-13 14:49:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-11-13 14:49:49,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 14:49:49,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:49,325 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:49,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:49,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:49,526 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:49,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:49,526 INFO L85 PathProgramCache]: Analyzing trace with hash -287777557, now seen corresponding path program 2 times [2024-11-13 14:49:49,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:49:49,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545179241] [2024-11-13 14:49:49,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 14:49:49,527 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-13 14:49:49,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:49:49,531 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:49,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:49:50,297 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 14:49:50,297 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:49:50,321 WARN L253 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 14:49:50,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:01,407 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-13 14:50:09,713 WARN L286 SmtUtils]: Spent 8.28s 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-13 14:50:13,827 WARN L873 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)))) is different from true [2024-11-13 14:50:22,500 WARN L286 SmtUtils]: Spent 8.32s 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-13 14:50:26,877 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) 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 8 24) 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-13 14:50:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-13 14:50:26,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:51:00,144 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-13 14:51:08,355 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:51:16,529 WARN L286 SmtUtils]: Spent 8.17s 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-13 14:51:20,581 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2024-11-13 14:51:24,633 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2024-11-13 14:51:32,921 WARN L286 SmtUtils]: Spent 8.29s 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-13 14:51:41,175 WARN L286 SmtUtils]: Spent 8.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-13 14:51:45,249 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-13 14:51:49,330 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-13 14:51:57,684 WARN L286 SmtUtils]: Spent 8.35s 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-13 14:52:06,012 WARN L286 SmtUtils]: Spent 8.33s 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-13 14:52:10,106 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-13 14:52:14,203 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-13 14:52:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-13 14:52:14,204 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:52:14,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545179241] [2024-11-13 14:52:14,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545179241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:52:14,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:52:14,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2024-11-13 14:52:14,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949543537] [2024-11-13 14:52:14,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:52:14,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 14:52:14,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:52:14,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 14:52:14,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=56, Unknown=11, NotChecked=140, Total=240 [2024-11-13 14:52:14,207 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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-13 14:52:18,863 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-13 14:52:22,953 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1) .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 14:52:30,230 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0)) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) .cse0))) (or (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq (fp.div c_currentRoundingMode .cse1 .cse0) .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 14:52:34,281 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 14:52:38,385 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (or (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0) |c_ULTIMATE.start_main_~x1~0#1|)) (fp.eq |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (= |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 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)))) is different from false [2024-11-13 14:53:05,230 WARN L286 SmtUtils]: Spent 9.02s 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-13 14:53:06,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:53:10,292 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-13 14:53:12,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:53:34,953 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-13 14:53:39,584 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-13 14:53:49,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:53:55,596 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-13 14:53:56,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:53:56,603 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-11-13 14:53:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 14:53:56,604 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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-13 14:53:56,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:53:56,604 INFO L225 Difference]: With dead ends: 20 [2024-11-13 14:53:56,604 INFO L226 Difference]: Without dead ends: 14 [2024-11-13 14:53:56,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 140.1s TimeCoverageRelationStatistics Valid=67, Invalid=141, Unknown=22, NotChecked=420, Total=650 [2024-11-13 14:53:56,606 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 26.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:53:56,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 13 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 4 Unknown, 148 Unchecked, 26.2s Time] [2024-11-13 14:53:56,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-13 14:53:56,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-13 14:53:56,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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-13 14:53:56,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-11-13 14:53:56,617 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2024-11-13 14:53:56,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:53:56,617 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-13 14:53:56,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 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-13 14:53:56,618 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-11-13 14:53:56,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 14:53:56,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:53:56,618 INFO L215 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2024-11-13 14:53:56,634 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:53:56,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:53:56,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:53:56,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:53:56,820 INFO L85 PathProgramCache]: Analyzing trace with hash -329504305, now seen corresponding path program 3 times [2024-11-13 14:53:56,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:53:56,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070643342] [2024-11-13 14:53:56,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 14:53:56,821 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-13 14:53:56,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:53:56,823 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:53:56,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:53:57,976 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-13 14:53:57,976 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:53:58,011 WARN L253 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 14:53:58,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:54:14,664 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-13 14:54:22,071 WARN L286 SmtUtils]: Spent 7.37s 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-13 14:54:26,190 WARN L873 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0)))) is different from true [2024-11-13 14:54:34,694 WARN L286 SmtUtils]: Spent 8.37s 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-13 14:54:39,142 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) 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 8 24) 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-13 14:54:47,725 WARN L286 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:54:56,186 WARN L286 SmtUtils]: Spent 8.46s 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-13 14:55:04,742 WARN L286 SmtUtils]: Spent 8.56s 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-13 14:55:13,217 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-13 14:55:17,317 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| .cse1)) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse1 .cse0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-13 14:55:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2024-11-13 14:55:17,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:55:42,594 WARN L286 SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:55:50,054 WARN L286 SmtUtils]: Spent 7.46s 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-13 14:55:57,352 WARN L286 SmtUtils]: Spent 7.30s 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-13 14:56:03,339 WARN L286 SmtUtils]: Spent 5.99s 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-13 14:56:10,535 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-13 14:56:18,782 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:56:27,056 WARN L286 SmtUtils]: Spent 8.27s 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-13 14:56:35,315 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-13 14:56:39,392 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) 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 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)))))) is different from false [2024-11-13 14:56:43,469 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) 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 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)))))) is different from true [2024-11-13 14:56:51,823 WARN L286 SmtUtils]: Spent 8.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-13 14:57:00,153 WARN L286 SmtUtils]: Spent 8.33s 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-13 14:57:08,505 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-13 14:57:12,602 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2024-11-13 14:57:16,707 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2024-11-13 14:57:25,203 WARN L286 SmtUtils]: Spent 8.49s 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-13 14:57:33,618 WARN L286 SmtUtils]: Spent 8.41s 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-13 14:57:42,142 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:57:46,265 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) .cse2) .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2024-11-13 14:57:50,405 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) .cse2) .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2024-11-13 14:57:58,870 WARN L286 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:58:07,352 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:58:15,889 WARN L286 SmtUtils]: Spent 8.54s 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-13 14:58:20,044 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .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 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse2))))) is different from false [2024-11-13 14:58:24,191 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .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 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse2))))) is different from true [2024-11-13 14:58:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2024-11-13 14:58:24,191 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:58:24,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070643342] [2024-11-13 14:58:24,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070643342] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:58:24,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:58:24,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2024-11-13 14:58:24,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939452867] [2024-11-13 14:58:24,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:58:24,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 14:58:24,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:58:24,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 14:58:24,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=57, Unknown=15, NotChecked=198, Total=306 [2024-11-13 14:58:24,194 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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-13 14:58:29,136 WARN L873 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .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 8 24) c_currentRoundingMode (_ bv0 32))) (fp.eq .cse0 .cse2)))))) is different from true [2024-11-13 14:58:33,299 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse1 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) .cse2) .cse2))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse2) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse2)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 14:58:37,421 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse2 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) .cse1))) (let ((.cse0 (fp.div c_currentRoundingMode .cse2 .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 .cse2) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse1) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 14:58:45,030 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0)) (let ((.cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse2 .cse0))) (or (fp.eq .cse1 ((_ to_fp 8 24) 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-13 14:58:49,165 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (= |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 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1)))) is different from false [2024-11-13 14:58:53,322 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1))) (or (not (fp.eq (fp.div c_currentRoundingMode .cse0 .cse1) .cse0)) (fp.eq .cse0 |c_ULTIMATE.start_main_~x1~0#1|) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (= |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 8 24) c_currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1)))) is different from true [2024-11-13 14:59:21,586 WARN L286 SmtUtils]: Spent 11.08s on a formula simplification. DAG size of input: 25 DAG size of output: 17 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:59:24,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:59:25,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:59:29,848 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.eq |c_ULTIMATE.start_main_~x1~0#1| |c_ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (.cse3 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse2) .cse2) .cse2) .cse2))) (and (or (not .cse0) (fp.eq |c_ULTIMATE.start_main_~x~0#1| .cse1)) (or (not (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) |c_ULTIMATE.start_main_~x1~0#1|)) .cse0 (fp.eq |c_ULTIMATE.start_main_~x1~0#1| .cse1)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2)) (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| .cse3)) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse3 .cse2)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-13 14:59:34,187 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-13 14:59:39,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:59:40,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:59:40,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:59:40,975 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2024-11-13 14:59:40,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:59:40,976 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 14:59:40,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:59:40,977 INFO L225 Difference]: With dead ends: 18 [2024-11-13 14:59:40,977 INFO L226 Difference]: Without dead ends: 14 [2024-11-13 14:59:40,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 147.2s TimeCoverageRelationStatistics Valid=53, Invalid=72, Unknown=25, NotChecked=450, Total=600 [2024-11-13 14:59:40,978 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:59:40,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 2 Unknown, 161 Unchecked, 15.9s Time] [2024-11-13 14:59:40,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-13 14:59:40,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-13 14:59:40,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-13 14:59:40,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-11-13 14:59:40,983 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2024-11-13 14:59:40,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:59:40,983 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-11-13 14:59:40,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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-13 14:59:40,983 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-11-13 14:59:40,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 14:59:40,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:59:40,984 INFO L215 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1] [2024-11-13 14:59:41,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:59:41,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:59:41,185 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:59:41,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:59:41,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1227234639, now seen corresponding path program 4 times [2024-11-13 14:59:41,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:59:41,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080786455] [2024-11-13 14:59:41,186 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 14:59:41,186 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-13 14:59:41,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:59:41,187 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:59:41,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b25791a-07a8-4dcf-99c1-89c5cd07eff2/bin/uautomizer-verify-qhAvR1uOyd/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-13 14:59:42,419 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 14:59:42,419 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 14:59:42,462 WARN L253 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 14:59:42,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:59:50,579 WARN L851 $PredicateComparison]: unable to prove that (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0))) is different from false [2024-11-13 14:59:59,385 WARN L286 SmtUtils]: Spent 7.34s 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-13 15:00:22,678 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 15:00:30,883 WARN L286 SmtUtils]: Spent 8.20s 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-13 15:00:34,990 WARN L851 $PredicateComparison]: unable to prove that (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0))) is different from false [2024-11-13 15:00:39,097 WARN L873 $PredicateComparison]: unable to prove that (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0))) is different from true [2024-11-13 15:00:47,357 WARN L286 SmtUtils]: Spent 8.26s 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-13 15:00:51,493 WARN L851 $PredicateComparison]: unable to prove that (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0))) is different from false [2024-11-13 15:00:55,632 WARN L873 $PredicateComparison]: unable to prove that (= |c_ULTIMATE.start_main_~x1~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0))) is different from true [2024-11-13 15:01:04,034 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:01:08,194 WARN L851 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) is different from false [2024-11-13 15:01:12,372 WARN L873 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) is different from true [2024-11-13 15:01:20,781 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:01:24,980 WARN L851 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) is different from false [2024-11-13 15:01:29,172 WARN L873 $PredicateComparison]: unable to prove that (= (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~x1~0#1|) is different from true [2024-11-13 15:01:37,618 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:01:46,222 WARN L286 SmtUtils]: Spent 8.60s 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-13 15:01:50,421 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .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)))) is different from false [2024-11-13 15:01:54,620 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .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)))) is different from true [2024-11-13 15:02:03,178 WARN L286 SmtUtils]: Spent 8.56s 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-13 15:02:11,602 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:02:15,833 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 8.0 5.0)))) (and (= (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (fp.eq (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) |c_ULTIMATE.start_main_~x~0#1|))) is different from false [2024-11-13 15:02:29,779 WARN L286 SmtUtils]: Spent 8.70s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:02:38,563 WARN L286 SmtUtils]: Spent 8.78s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:02:51,469 WARN L286 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:03:00,123 WARN L286 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:03:04,495 WARN L851 $PredicateComparison]: unable to prove that (or (and (exists ((currentRoundingMode RoundingMode)) (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (not (fp.eq .cse0 ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)))) (fp.eq (fp.div currentRoundingMode .cse0 .cse1) .cse0))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (exists ((currentRoundingMode RoundingMode)) (let ((.cse3 ((_ to_fp 8 24) currentRoundingMode (/ 8.0 5.0)))) (let ((.cse2 (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3))) (and (fp.eq .cse2 ((_ to_fp 8 24) currentRoundingMode (_ bv0 32))) (fp.eq (fp.div currentRoundingMode .cse2 .cse3) .cse2))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))) is different from false [2024-11-13 15:03:17,459 WARN L286 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:03:26,093 WARN L286 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:03:30,299 WARN L851 $PredicateComparison]: unable to prove that (exists ((currentRoundingMode RoundingMode)) (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (not (fp.eq .cse0 ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)))) (fp.eq (fp.div currentRoundingMode .cse0 .cse1) .cse0))))) is different from false [2024-11-13 15:03:34,469 WARN L873 $PredicateComparison]: unable to prove that (exists ((currentRoundingMode RoundingMode)) (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 8.0 5.0)))) (let ((.cse0 (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (not (fp.eq .cse0 ((_ to_fp 8 24) currentRoundingMode (_ bv0 32)))) (fp.eq (fp.div currentRoundingMode .cse0 .cse1) .cse0))))) is different from true [2024-11-13 15:03:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 27 not checked. [2024-11-13 15:03:34,470 INFO L311 TraceCheckSpWp]: Computing backward predicates...