./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:11:05,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:11:05,772 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 01:11:05,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:11:05,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:11:05,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:11:05,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:11:05,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:11:05,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:11:05,829 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:11:05,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:11:05,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:11:05,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:11:05,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:11:05,830 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:11:05,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:11:05,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:11:05,831 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:11:05,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 01:11:05,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:11:05,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:11:05,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:11:05,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:11:05,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:11:05,832 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:11:05,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:11:05,832 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:11:05,832 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:11:05,832 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:11:05,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:11:05,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:11:05,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:11:05,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:11:05,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:11:05,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:11:05,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:11:05,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:11:05,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:11:05,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:11:05,833 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:11:05,833 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:11:05,834 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:11:05,834 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 01:11:05,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 01:11:05,834 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:11:05,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:11:05,834 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:11:05,835 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:11:05,835 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_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e [2024-11-24 01:11:06,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:11:06,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:11:06,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:11:06,172 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:11:06,172 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:11:06,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2024-11-24 01:11:09,107 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/data/2b872b0e3/9dc5151b9bea432d97b5bdf15f1b9a67/FLAGf50b7138d [2024-11-24 01:11:09,401 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:11:09,404 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2024-11-24 01:11:09,421 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/data/2b872b0e3/9dc5151b9bea432d97b5bdf15f1b9a67/FLAGf50b7138d [2024-11-24 01:11:09,683 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/data/2b872b0e3/9dc5151b9bea432d97b5bdf15f1b9a67 [2024-11-24 01:11:09,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:11:09,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:11:09,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:11:09,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:11:09,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:11:09,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:11:09" (1/1) ... [2024-11-24 01:11:09,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3396942f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:09, skipping insertion in model container [2024-11-24 01:11:09,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:11:09" (1/1) ... [2024-11-24 01:11:09,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:11:09,891 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_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2024-11-24 01:11:09,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:11:09,915 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:11:09,935 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_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2024-11-24 01:11:09,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:11:09,955 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:11:09,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:09 WrapperNode [2024-11-24 01:11:09,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:11:09,959 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:11:09,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:11:09,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:11:09,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:09" (1/1) ... [2024-11-24 01:11:09,973 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:09" (1/1) ... [2024-11-24 01:11:09,989 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 85 [2024-11-24 01:11:09,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:11:09,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:11:09,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:11:09,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:11:10,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:09" (1/1) ... [2024-11-24 01:11:10,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:09" (1/1) ... [2024-11-24 01:11:10,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:09" (1/1) ... [2024-11-24 01:11:10,017 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-24 01:11:10,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:09" (1/1) ... [2024-11-24 01:11:10,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:09" (1/1) ... [2024-11-24 01:11:10,023 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:09" (1/1) ... [2024-11-24 01:11:10,026 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:09" (1/1) ... [2024-11-24 01:11:10,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:09" (1/1) ... [2024-11-24 01:11:10,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:09" (1/1) ... [2024-11-24 01:11:10,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:09" (1/1) ... [2024-11-24 01:11:10,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:11:10,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:11:10,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:11:10,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:11:10,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:09" (1/1) ... [2024-11-24 01:11:10,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:11:10,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:11:10,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:11:10,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:11:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:11:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 01:11:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:11:10,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:11:10,173 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:11:10,176 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:11:10,350 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-24 01:11:10,350 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:11:10,361 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:11:10,362 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-24 01:11:10,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:11:10 BoogieIcfgContainer [2024-11-24 01:11:10,362 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:11:10,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:11:10,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:11:10,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:11:10,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:11:09" (1/3) ... [2024-11-24 01:11:10,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7a33b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:11:10, skipping insertion in model container [2024-11-24 01:11:10,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:09" (2/3) ... [2024-11-24 01:11:10,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7a33b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:11:10, skipping insertion in model container [2024-11-24 01:11:10,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:11:10" (3/3) ... [2024-11-24 01:11:10,376 INFO L128 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.p+cfa-reducer.c [2024-11-24 01:11:10,392 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:11:10,397 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rlim_invariant.c.p+cfa-reducer.c that has 1 procedures, 24 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-24 01:11:10,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:11:10,477 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;@3fee4f1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:11:10,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:11:10,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:11:10,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-24 01:11:10,489 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:10,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:11:10,489 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:11:10,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:10,496 INFO L85 PathProgramCache]: Analyzing trace with hash -34829450, now seen corresponding path program 1 times [2024-11-24 01:11:10,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:11:10,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895430387] [2024-11-24 01:11:10,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:10,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:11:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:10,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:11:10,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895430387] [2024-11-24 01:11:10,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895430387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:11:10,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:11:10,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:11:10,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722628262] [2024-11-24 01:11:10,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:11:10,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:11:10,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:11:10,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:11:10,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:11:10,844 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 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 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:11:10,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:11:10,911 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2024-11-24 01:11:10,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:11:10,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-24 01:11:10,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:11:10,920 INFO L225 Difference]: With dead ends: 32 [2024-11-24 01:11:10,921 INFO L226 Difference]: Without dead ends: 24 [2024-11-24 01:11:10,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:11:10,929 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:11:10,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:11:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-24 01:11:10,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-11-24 01:11:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:11:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-11-24 01:11:10,967 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2024-11-24 01:11:10,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:11:10,967 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-11-24 01:11:10,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:11:10,968 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-24 01:11:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-24 01:11:10,969 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:10,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:11:10,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 01:11:10,969 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:11:10,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:10,971 INFO L85 PathProgramCache]: Analyzing trace with hash -17818789, now seen corresponding path program 1 times [2024-11-24 01:11:10,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:11:10,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424745488] [2024-11-24 01:11:10,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:10,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:11:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:11:11,000 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 01:11:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:11:11,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 01:11:11,042 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 01:11:11,044 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-24 01:11:11,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 01:11:11,049 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-24 01:11:11,078 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 01:11:11,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:11:11 BoogieIcfgContainer [2024-11-24 01:11:11,084 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 01:11:11,085 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 01:11:11,085 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 01:11:11,085 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 01:11:11,086 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:11:10" (3/4) ... [2024-11-24 01:11:11,088 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 01:11:11,089 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 01:11:11,090 INFO L158 Benchmark]: Toolchain (without parser) took 1402.93ms. Allocated memory is still 142.6MB. Free memory was 119.8MB in the beginning and 69.2MB in the end (delta: 50.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-24 01:11:11,090 INFO L158 Benchmark]: CDTParser took 1.33ms. Allocated memory is still 142.6MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:11:11,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.94ms. Allocated memory is still 142.6MB. Free memory was 119.5MB in the beginning and 108.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 01:11:11,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.45ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 107.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:11:11,092 INFO L158 Benchmark]: Boogie Preprocessor took 48.55ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 105.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:11:11,095 INFO L158 Benchmark]: RCFGBuilder took 322.73ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 95.1MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-24 01:11:11,095 INFO L158 Benchmark]: TraceAbstraction took 719.71ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 69.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-24 01:11:11,095 INFO L158 Benchmark]: Witness Printer took 4.38ms. Allocated memory is still 142.6MB. Free memory was 69.4MB in the beginning and 69.2MB in the end (delta: 253.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:11:11,097 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.33ms. Allocated memory is still 142.6MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.94ms. Allocated memory is still 142.6MB. Free memory was 119.5MB in the beginning and 108.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.45ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 107.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.55ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 105.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 322.73ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 95.1MB in the end (delta: 10.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 719.71ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 69.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 4.38ms. Allocated memory is still 142.6MB. Free memory was 69.4MB in the beginning and 69.2MB in the end (delta: 253.2kB). 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: 66]: 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 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 30, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryDOUBLEComparisonOperation at line 39, overapproximation of someBinaryDOUBLEComparisonOperation at line 37, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of to_real at line 20, overapproximation of someBinaryArithmeticFLOAToperation at line 47, overapproximation of someBinaryArithmeticFLOAToperation at line 50. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L14] float main__X; [L15] float main__Y; [L16] float main__S; [L17] float main__R; [L18] float main__D; [L19] int main__i; [L20] main__Y = 0 [L21] main__i = 0 VAL [__return_main=0, main__i=0] [L23] COND TRUE main__i < 100000 [L25] main__X = __VERIFIER_nondet_float() [L26] main__D = __VERIFIER_nondet_float() [L27] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__i=0] [L28] COND TRUE main__X >= -128.0 VAL [__return_main=0, main__i=0] [L30] COND TRUE main__X <= 128.0 [L32] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0] [L34] COND TRUE main____CPAchecker_TMP_0 != 0 [L36] int main____CPAchecker_TMP_1; VAL [__return_main=0, main__i=0] [L37] COND TRUE main__D >= 0.0 VAL [__return_main=0, main__i=0] [L39] COND TRUE main__D <= 16.0 [L41] main____CPAchecker_TMP_1 = 1 VAL [__return_main=0, main____CPAchecker_TMP_1=1, main__i=0] [L43] COND TRUE main____CPAchecker_TMP_1 != 0 [L45] main__S = main__Y [L46] main__Y = main__X [L47] main__R = main__X - main__S VAL [__return_main=0, main__Y=54, main__i=0] [L48] COND TRUE main__R <= (-main__D) [L50] main__Y = main__S - main__D VAL [__return_main=0, main__i=0] [L52] int main____CPAchecker_TMP_2; VAL [__return_main=0, main__i=0] [L53] COND FALSE !(main__Y >= -129.0) VAL [__return_main=0, main__i=0] [L79] main____CPAchecker_TMP_2 = 0 VAL [__return_main=0, main____CPAchecker_TMP_2=0, main__i=0] [L60] int __tmp_1; [L61] __tmp_1 = main____CPAchecker_TMP_2 [L62] int __VERIFIER_assert__cond; [L63] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_main=0, main__i=0] [L64] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, main__i=0] [L66] reach_error() VAL [__return_main=0, main__i=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 31 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 23 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-24 01:11:11,116 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:11:13,731 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:11:13,860 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-24 01:11:13,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:11:13,871 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:11:13,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:11:13,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:11:13,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:11:13,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:11:13,898 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:11:13,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:11:13,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:11:13,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:11:13,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:11:13,899 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:11:13,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:11:13,899 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:11:13,899 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:11:13,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:11:13,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:11:13,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:11:13,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:11:13,900 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:11:13,900 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 01:11:13,900 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-24 01:11:13,900 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-24 01:11:13,900 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:11:13,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:11:13,900 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:11:13,900 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:11:13,900 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:11:13,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:11:13,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:11:13,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:11:13,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:11:13,901 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:11:13,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:11:13,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:11:13,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:11:13,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:11:13,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:11:13,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:11:13,901 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:11:13,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:11:13,902 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-24 01:11:13,902 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-24 01:11:13,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:11:13,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:11:13,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:11:13,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:11:13,902 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_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e [2024-11-24 01:11:14,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:11:14,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:11:14,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:11:14,194 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:11:14,194 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:11:14,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2024-11-24 01:11:17,205 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/data/fb302044f/5a2f0fb73867489989cdab495077d51b/FLAG7e4cf16b0 [2024-11-24 01:11:17,464 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:11:17,465 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2024-11-24 01:11:17,472 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/data/fb302044f/5a2f0fb73867489989cdab495077d51b/FLAG7e4cf16b0 [2024-11-24 01:11:17,493 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/data/fb302044f/5a2f0fb73867489989cdab495077d51b [2024-11-24 01:11:17,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:11:17,498 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:11:17,499 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:11:17,499 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:11:17,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:11:17,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:11:17" (1/1) ... [2024-11-24 01:11:17,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26072c22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:17, skipping insertion in model container [2024-11-24 01:11:17,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:11:17" (1/1) ... [2024-11-24 01:11:17,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:11:17,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_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2024-11-24 01:11:17,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:11:17,740 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:11:17,762 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_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2024-11-24 01:11:17,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:11:17,790 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:11:17,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:17 WrapperNode [2024-11-24 01:11:17,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:11:17,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:11:17,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:11:17,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:11:17,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:17" (1/1) ... [2024-11-24 01:11:17,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:17" (1/1) ... [2024-11-24 01:11:17,836 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2024-11-24 01:11:17,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:11:17,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:11:17,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:11:17,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:11:17,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:17" (1/1) ... [2024-11-24 01:11:17,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:17" (1/1) ... [2024-11-24 01:11:17,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:17" (1/1) ... [2024-11-24 01:11:17,867 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-24 01:11:17,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:17" (1/1) ... [2024-11-24 01:11:17,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:17" (1/1) ... [2024-11-24 01:11:17,879 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:17" (1/1) ... [2024-11-24 01:11:17,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:17" (1/1) ... [2024-11-24 01:11:17,882 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:17" (1/1) ... [2024-11-24 01:11:17,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:17" (1/1) ... [2024-11-24 01:11:17,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:17" (1/1) ... [2024-11-24 01:11:17,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:11:17,894 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:11:17,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:11:17,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:11:17,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:17" (1/1) ... [2024-11-24 01:11:17,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:11:17,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:11:17,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:11:17,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:11:17,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:11:17,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-24 01:11:17,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:11:17,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:11:18,045 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:11:18,047 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:11:19,062 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-24 01:11:19,062 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:11:19,071 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:11:19,071 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-24 01:11:19,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:11:19 BoogieIcfgContainer [2024-11-24 01:11:19,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:11:19,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:11:19,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:11:19,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:11:19,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:11:17" (1/3) ... [2024-11-24 01:11:19,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f99c011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:11:19, skipping insertion in model container [2024-11-24 01:11:19,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:11:17" (2/3) ... [2024-11-24 01:11:19,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f99c011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:11:19, skipping insertion in model container [2024-11-24 01:11:19,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:11:19" (3/3) ... [2024-11-24 01:11:19,082 INFO L128 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.p+cfa-reducer.c [2024-11-24 01:11:19,098 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:11:19,100 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rlim_invariant.c.p+cfa-reducer.c that has 1 procedures, 24 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-24 01:11:19,159 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:11:19,170 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;@53407816, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:11:19,171 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:11:19,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:11:19,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-24 01:11:19,180 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:19,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:11:19,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:11:19,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:19,188 INFO L85 PathProgramCache]: Analyzing trace with hash -34829450, now seen corresponding path program 1 times [2024-11-24 01:11:19,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:11:19,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248758740] [2024-11-24 01:11:19,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:19,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:11:19,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:11:19,204 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:11:19,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-24 01:11:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:19,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 01:11:19,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:11:19,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:19,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:11:19,426 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:11:19,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248758740] [2024-11-24 01:11:19,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248758740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:11:19,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:11:19,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:11:19,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531331690] [2024-11-24 01:11:19,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:11:19,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:11:19,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:11:19,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:11:19,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:11:19,453 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 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 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:11:19,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:11:19,499 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2024-11-24 01:11:19,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:11:19,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-24 01:11:19,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:11:19,510 INFO L225 Difference]: With dead ends: 31 [2024-11-24 01:11:19,510 INFO L226 Difference]: Without dead ends: 23 [2024-11-24 01:11:19,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:11:19,517 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:11:19,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-24 01:11:19,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-24 01:11:19,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-24 01:11:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:11:19,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-11-24 01:11:19,547 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2024-11-24 01:11:19,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:11:19,547 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-11-24 01:11:19,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:11:19,548 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-24 01:11:19,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-24 01:11:19,548 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:11:19,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:11:19,554 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-24 01:11:19,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:11:19,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:11:19,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:11:19,750 INFO L85 PathProgramCache]: Analyzing trace with hash -17818789, now seen corresponding path program 1 times [2024-11-24 01:11:19,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:11:19,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254142723] [2024-11-24 01:11:19,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:11:19,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:11:19,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:11:19,754 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:11:19,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-24 01:11:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:11:19,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-24 01:11:19,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:11:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:11:30,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:11:30,892 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:11:30,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254142723] [2024-11-24 01:11:30,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254142723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:11:30,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:11:30,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:11:30,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975910015] [2024-11-24 01:11:30,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:11:30,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:11:30,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:11:30,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:11:30,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=22, Unknown=2, NotChecked=0, Total=42 [2024-11-24 01:11:30,898 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:11:34,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:11:41,792 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 [0] [2024-11-24 01:11:46,125 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 [0] [2024-11-24 01:11:50,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:11:54,986 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 [0] [2024-11-24 01:12:01,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:12:04,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:12:05,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:12:09,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:12:14,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:12:18,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:12:20,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:12:22,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:12:26,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:12:30,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:12:35,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:12:36,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:12:38,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:12:42,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:12:46,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:12:46,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:12:46,935 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2024-11-24 01:12:46,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 01:12:46,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-24 01:12:46,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:12:46,941 INFO L225 Difference]: With dead ends: 75 [2024-11-24 01:12:46,941 INFO L226 Difference]: Without dead ends: 54 [2024-11-24 01:12:46,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=18, Invalid=22, Unknown=2, NotChecked=0, Total=42 [2024-11-24 01:12:46,942 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 76.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:12:46,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 42 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 13 Unknown, 0 Unchecked, 76.0s Time] [2024-11-24 01:12:46,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-24 01:12:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2024-11-24 01:12:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:12:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2024-11-24 01:12:46,947 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 16 [2024-11-24 01:12:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:12:46,947 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2024-11-24 01:12:46,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:12:46,947 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2024-11-24 01:12:46,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-24 01:12:46,948 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:12:46,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:12:46,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-24 01:12:47,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:12:47,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:12:47,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:12:47,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1271663018, now seen corresponding path program 1 times [2024-11-24 01:12:47,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:12:47,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802741956] [2024-11-24 01:12:47,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:12:47,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:12:47,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:12:47,151 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:12:47,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-24 01:12:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:12:47,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-24 01:12:47,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:12:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:12:47,264 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:12:47,264 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:12:47,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802741956] [2024-11-24 01:12:47,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802741956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:12:47,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:12:47,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:12:47,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224198872] [2024-11-24 01:12:47,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:12:47,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:12:47,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:12:47,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:12:47,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:12:47,266 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:12:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:12:47,381 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2024-11-24 01:12:47,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:12:47,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-24 01:12:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:12:47,385 INFO L225 Difference]: With dead ends: 56 [2024-11-24 01:12:47,385 INFO L226 Difference]: Without dead ends: 33 [2024-11-24 01:12:47,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:12:47,386 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:12:47,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:12:47,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-24 01:12:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-24 01:12:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:12:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2024-11-24 01:12:47,390 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 16 [2024-11-24 01:12:47,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:12:47,391 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-24 01:12:47,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:12:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2024-11-24 01:12:47,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-24 01:12:47,392 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:12:47,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:12:47,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-24 01:12:47,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:12:47,592 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:12:47,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:12:47,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1069421883, now seen corresponding path program 1 times [2024-11-24 01:12:47,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:12:47,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548310862] [2024-11-24 01:12:47,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:12:47,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:12:47,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:12:47,597 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:12:47,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-24 01:12:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:12:47,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-24 01:12:47,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:12:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:12:52,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:12:52,464 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:12:52,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548310862] [2024-11-24 01:12:52,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548310862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:12:52,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:12:52,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:12:52,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560475388] [2024-11-24 01:12:52,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:12:52,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:12:52,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:12:52,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:12:52,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:12:52,465 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:13:06,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:13:06,471 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2024-11-24 01:13:06,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 01:13:06,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-24 01:13:06,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:13:06,480 INFO L225 Difference]: With dead ends: 72 [2024-11-24 01:13:06,480 INFO L226 Difference]: Without dead ends: 52 [2024-11-24 01:13:06,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:13:06,481 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 52 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:13:06,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 62 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2024-11-24 01:13:06,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-24 01:13:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 34. [2024-11-24 01:13:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:13:06,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-11-24 01:13:06,486 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 17 [2024-11-24 01:13:06,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:13:06,486 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-11-24 01:13:06,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:13:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-24 01:13:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-24 01:13:06,487 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:13:06,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:13:06,492 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-24 01:13:06,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:13:06,688 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:13:06,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:13:06,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1450538051, now seen corresponding path program 1 times [2024-11-24 01:13:06,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:13:06,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894227560] [2024-11-24 01:13:06,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:13:06,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:13:06,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:13:06,690 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:13:06,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-24 01:13:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:13:06,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 01:13:06,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:13:10,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:13:10,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:13:10,908 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:13:10,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894227560] [2024-11-24 01:13:10,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894227560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:13:10,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:13:10,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:13:10,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743672735] [2024-11-24 01:13:10,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:13:10,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:13:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:13:10,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:13:10,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:13:10,911 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:13:29,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:13:29,071 INFO L93 Difference]: Finished difference Result 98 states and 122 transitions. [2024-11-24 01:13:29,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 01:13:29,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-24 01:13:29,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:13:29,084 INFO L225 Difference]: With dead ends: 98 [2024-11-24 01:13:29,085 INFO L226 Difference]: Without dead ends: 78 [2024-11-24 01:13:29,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:13:29,086 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2024-11-24 01:13:29,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 61 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 14.5s Time] [2024-11-24 01:13:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-24 01:13:29,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2024-11-24 01:13:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:13:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2024-11-24 01:13:29,091 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 17 [2024-11-24 01:13:29,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:13:29,092 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-11-24 01:13:29,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:13:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2024-11-24 01:13:29,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-24 01:13:29,097 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:13:29,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:13:29,101 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-24 01:13:29,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:13:29,298 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:13:29,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:13:29,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1069229389, now seen corresponding path program 1 times [2024-11-24 01:13:29,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:13:29,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097582398] [2024-11-24 01:13:29,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:13:29,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:13:29,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:13:29,300 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:13:29,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-24 01:13:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:13:29,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-24 01:13:29,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:13:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:13:39,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:13:39,564 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:13:39,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097582398] [2024-11-24 01:13:39,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097582398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:13:39,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:13:39,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 01:13:39,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201455773] [2024-11-24 01:13:39,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:13:39,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 01:13:39,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:13:39,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 01:13:39,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:13:39,566 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:13:51,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:13:51,343 INFO L93 Difference]: Finished difference Result 95 states and 120 transitions. [2024-11-24 01:13:51,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:13:51,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-24 01:13:51,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:13:51,349 INFO L225 Difference]: With dead ends: 95 [2024-11-24 01:13:51,350 INFO L226 Difference]: Without dead ends: 66 [2024-11-24 01:13:51,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:13:51,350 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 47 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2024-11-24 01:13:51,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 40 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2024-11-24 01:13:51,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-24 01:13:51,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 49. [2024-11-24 01:13:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:13:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2024-11-24 01:13:51,364 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 17 [2024-11-24 01:13:51,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:13:51,364 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-11-24 01:13:51,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:13:51,365 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2024-11-24 01:13:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-24 01:13:51,365 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:13:51,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:13:51,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-24 01:13:51,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:13:51,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:13:51,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:13:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1175383176, now seen corresponding path program 1 times [2024-11-24 01:13:51,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:13:51,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595129438] [2024-11-24 01:13:51,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:13:51,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:13:51,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:13:51,573 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:13:51,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-24 01:13:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:13:51,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-24 01:13:51,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:13:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:13:51,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:13:51,679 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:13:51,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595129438] [2024-11-24 01:13:51,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595129438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:13:51,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:13:51,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:13:51,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661131221] [2024-11-24 01:13:51,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:13:51,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:13:51,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:13:51,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:13:51,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:13:51,680 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:13:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:13:51,855 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2024-11-24 01:13:51,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:13:51,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-24 01:13:51,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:13:51,857 INFO L225 Difference]: With dead ends: 75 [2024-11-24 01:13:51,857 INFO L226 Difference]: Without dead ends: 35 [2024-11-24 01:13:51,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:13:51,858 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:13:51,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 01:13:51,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-24 01:13:51,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-24 01:13:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:13:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-24 01:13:51,867 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 17 [2024-11-24 01:13:51,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:13:51,868 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-24 01:13:51,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:13:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-24 01:13:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-24 01:13:51,868 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:13:51,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:13:51,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-24 01:13:52,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:13:52,069 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:13:52,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:13:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1724506925, now seen corresponding path program 1 times [2024-11-24 01:13:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:13:52,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62571560] [2024-11-24 01:13:52,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:13:52,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:13:52,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:13:52,072 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:13:52,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-24 01:13:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:13:52,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-24 01:13:52,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:14:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:14:00,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:14:00,498 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:14:00,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62571560] [2024-11-24 01:14:00,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62571560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:14:00,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:14:00,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 01:14:00,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224285039] [2024-11-24 01:14:00,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:14:00,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-24 01:14:00,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:14:00,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-24 01:14:00,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:14:00,499 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:14:12,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:14:12,133 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2024-11-24 01:14:12,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-24 01:14:12,137 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-24 01:14:12,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:14:12,138 INFO L225 Difference]: With dead ends: 67 [2024-11-24 01:14:12,138 INFO L226 Difference]: Without dead ends: 45 [2024-11-24 01:14:12,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:14:12,139 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:14:12,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 39 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 11.6s Time] [2024-11-24 01:14:12,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-24 01:14:12,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2024-11-24 01:14:12,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:14:12,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-24 01:14:12,142 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 18 [2024-11-24 01:14:12,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:14:12,143 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-24 01:14:12,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:14:12,143 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-11-24 01:14:12,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-24 01:14:12,143 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:14:12,144 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:14:12,147 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-24 01:14:12,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:14:12,344 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:14:12,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:14:12,345 INFO L85 PathProgramCache]: Analyzing trace with hash -66815887, now seen corresponding path program 1 times [2024-11-24 01:14:12,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:14:12,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724571425] [2024-11-24 01:14:12,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:14:12,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-24 01:14:12,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:14:12,347 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-24 01:14:12,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7c0fcc2-ffb3-4f6b-b435-9b7ac9b89c2c/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-24 01:14:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:14:12,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-24 01:14:12,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:16:03,154 WARN L286 SmtUtils]: Spent 10.45s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-24 01:16:23,144 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:16:28,153 WARN L286 SmtUtils]: Spent 5.01s 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-24 01:16:36,236 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:16:43,944 WARN L286 SmtUtils]: Spent 7.71s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:16:51,067 WARN L286 SmtUtils]: Spent 7.12s on a formula simplification. DAG size of input: 9 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:16:58,705 WARN L286 SmtUtils]: Spent 7.64s on a formula simplification. DAG size of input: 5 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:17:04,988 WARN L286 SmtUtils]: Spent 6.28s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:17:09,006 WARN L851 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~main__R~0#1_13| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__R~0#1_14| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_17| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_18| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 16.0))) (and (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_13| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_17|)) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)) |v_ULTIMATE.start_main_~main__D~0#1_17|) |v_ULTIMATE.start_main_~main__D~0#1_18|)) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 129.0)))) (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_14| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_18|)) (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~main__D~0#1_17|) .cse0) (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~main__D~0#1_18|) .cse0)))) is different from false [2024-11-24 01:17:13,020 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~main__R~0#1_13| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__R~0#1_14| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_17| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_18| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 16.0))) (and (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_13| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_17|)) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)) |v_ULTIMATE.start_main_~main__D~0#1_17|) |v_ULTIMATE.start_main_~main__D~0#1_18|)) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 129.0)))) (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_14| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_18|)) (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~main__D~0#1_17|) .cse0) (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~main__D~0#1_18|) .cse0)))) is different from true [2024-11-24 01:17:25,104 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:17:30,610 WARN L286 SmtUtils]: Spent 5.51s 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-24 01:17:38,674 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:17:44,932 WARN L286 SmtUtils]: Spent 6.26s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:18:01,922 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:18:14,522 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:18:24,420 WARN L286 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:18:36,501 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:18:41,943 WARN L286 SmtUtils]: Spent 5.44s 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-24 01:18:50,092 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:18:56,184 WARN L286 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:19:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-24 01:19:00,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:20:37,535 WARN L286 SmtUtils]: Spent 6.35s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-24 01:21:59,066 WARN L286 SmtUtils]: Spent 12.35s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-24 01:23:01,327 WARN L286 SmtUtils]: Spent 5.90s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:23:12,434 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 129.0))) (or (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 16.0))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|)) (fp.neg .cse1)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|))))))) (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1|) .cse1)))) is different from false [2024-11-24 01:23:21,201 WARN L286 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:23:29,273 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:23:39,765 WARN L286 SmtUtils]: Spent 6.42s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:23:44,014 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 129.0))) (let ((.cse1 (fp.neg .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1|))) (or (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (not (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 16.0))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|)) .cse1) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|))))))) (not (fp.geq .cse2 .cse1)) (not (fp.leq .cse2 .cse3))))) is different from false [2024-11-24 01:23:53,439 WARN L286 SmtUtils]: Spent 5.83s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:24:01,522 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:24:09,630 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:24:16,571 WARN L286 SmtUtils]: Spent 6.94s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:24:28,271 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:24:35,541 WARN L286 SmtUtils]: Spent 7.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-24 01:24:43,499 WARN L286 SmtUtils]: Spent 7.96s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:24:51,342 WARN L286 SmtUtils]: Spent 7.84s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:24:56,511 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__S~0#1| |c_ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (.cse2 (fp.neg .cse1))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (forall ((|v_ULTIMATE.start_main_~main__R~0#1_16| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_20| (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_20|))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_16| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_20|))) (not (fp.geq .cse3 (_ +zero 11 53))) (not (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 16.0))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~main__D~0#1_20|)) .cse2)))) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |c_ULTIMATE.start_main_~main__D~0#1|))))))) is different from true [2024-11-24 01:25:04,654 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:25:12,477 WARN L286 SmtUtils]: Spent 7.82s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:25:20,573 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:25:28,663 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:25:35,706 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |c_ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (.cse1 (fp.neg .cse4))) (or (forall ((|v_ULTIMATE.start_main_~main__R~0#1_16| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_20| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_20|))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_16| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_20|))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~main__D~0#1_20|)) .cse1) (not (fp.geq .cse2 (_ +zero 11 53))) (not (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 16.0)))))) (not (fp.leq .cse3 .cse4)) (not (fp.geq .cse3 .cse1)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |c_ULTIMATE.start_main_~main__D~0#1|))))))) is different from true [2024-11-24 01:25:43,825 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:25:51,936 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:26:00,074 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:26:08,172 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:26:19,668 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse2 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse2)) (.cse3 (fp.neg .cse1))) (or (not (fp.leq .cse0 .cse1)) (forall ((|v_ULTIMATE.start_main_~main__R~0#1_16| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_20| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_20|))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_16| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_20|))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__D~0#1_20|)) .cse3) (not (fp.geq .cse4 (_ +zero 11 53))) (not (fp.leq .cse4 .cse5))))) (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|) .cse5)) (not (fp.geq .cse0 .cse3)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)))))))) is different from false [2024-11-24 01:26:23,705 WARN L873 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__D~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 129.0)) (.cse2 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__Y~0#1| |ULTIMATE.start_main_~main__D~0#1|))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 16.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode .cse2)) (.cse3 (fp.neg .cse1))) (or (not (fp.leq .cse0 .cse1)) (forall ((|v_ULTIMATE.start_main_~main__R~0#1_16| (_ FloatingPoint 8 24)) (|v_ULTIMATE.start_main_~main__D~0#1_20| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~main__D~0#1_20|))) (or (not (fp.leq |v_ULTIMATE.start_main_~main__R~0#1_16| (fp.neg |v_ULTIMATE.start_main_~main__D~0#1_20|))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~main__D~0#1_20|)) .cse3) (not (fp.geq .cse4 (_ +zero 11 53))) (not (fp.leq .cse4 .cse5))))) (not (fp.leq ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~main__D~0#1|) .cse5)) (not (fp.geq .cse0 .cse3)) (forall ((|ULTIMATE.start_main_~main__R~0#1| (_ FloatingPoint 8 24))) (not (fp.leq |ULTIMATE.start_main_~main__R~0#1| (fp.neg |ULTIMATE.start_main_~main__D~0#1|)))))))) is different from true [2024-11-24 01:26:31,841 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-24 01:26:39,944 WARN L286 SmtUtils]: Spent 8.10s 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)